Independent Domination of Splitted Graphs
A. Nellai Murugan, A.Esakki muthu · International Journal of Mathematics Trends and Technology · 2014
A dominating set D of a splitted graph S(G) = ( V, E ) is an independent dominating set if the induced subgraph has no edges. The independent domination number i[S(G)] of a graph S(G) is the minimum cardinality of an independent dominating set.