On independent domination number of Indubala product of some families of graphs
D. Anandhababu, N. Parvathi · AIP conference proceedings · 2019
Let D be a subset of vertex set V(G) of a graph G. Then D is called dominating set of G if every vertex in V(G)-D is adjacent to vertex set D. A set which is both independent and set. The minimum cardinally of an independent dominating set is called as the independent domination number of G and is denoted by i(G). In this article we investigate independent domination parameters in Indubala product of some families of graphs.