RESULTS ON THE INVERSE DOMINATION NUMBER OF SOME CLASS OF GRAPHS

A set D of vertices in a graph G(V, E) is a dominating set of G, if every vertex of V not in D is adjacent to at least one vertex in D. Let D be a minimum dominating set of G. If V – D contains a dominating set say D' is called an inverse dominating set with respect to D. The inverse domination number γ'(G) of G is the order of a smallest inverse dominating set of G. In this paper we establish inverse domination number for some families of graphs.