INVERSE DOMINATION AND INVERSE TOTAL DOMINATION FOR AN UNDIRECTED GRAPH
In this paper we analyze the domination parameters such as inverse domination and inverse total domination number of an undirected graph and obtained several results on these parameters. An undirected graph is a graph defined in [1], whose vertex set and are adjacent if and only if and where and A set D of vertices of a graph G is a dominating set if every vertex in is adjacent to some vertex in D. Let D be a minimum dominating set of G. If contains a dominating set say of G, then is called an inverse dominating set with respect to D. In this paper we obtain exact values of and for different values of m, n.
undirected graph, inverse domination number, inverse total domination number.