Edge Domination Number of Jump Graph
Mahendran Karthikeyan, Aarthi Elumalai · 2015
A Set ] ( [ G J E D ⊆ is dominating set of jump graph, if every edge not in D is adjacent to a edge in D. The domination number of the jump graph is the minimum cardinality of dominating set of jump graph J(G).We also study the graph theoretic properties of �� ′ [�� (�� )] and its exact values for some standard graphs. The relation between �� ′ [�� (�� )] with other parameter are also investigated.