INVERSE DOMINATION NUMBER OF JUMP GRAPH
Mahendran Karthikeyan, Aarthi Elumalai · International Journal of Pure and Apllied Mathematics · 2015
Let J(G) = (V, E) be a jump graph.Let D be a minimum dominating set in a jump Graph J(G).If V -D contains a dominating set D ′ of J(G), then D ′ is called an inverse dominating set with respect to D. The minimum cardinality of an inverse dominating set of a Jump graph J(G) is called the inverse domination number of J(G).In this paper We study the graph theoretic properties of inverse domination of Jump graph and its exact values for some standard graphs.The relation between inverse domination of Jump graph with other parameters is also investigated.