Inverse Connected and Disjoint Connected Domination Number of a Jump Graph
Annie Jasmine.S.E, K. Ameenal Bibi · International Journal of Engineering & Technology · 2018
Let D be the minimum connected dominating set of a jump graph . If of contains a connected dominating set , then is called the inverse connected dominating set of the jump graph . The minimum cardinality of an inverse connected dominating set is the inverse connected domination number of the jump graph, denoted by. The disjoint connected domination number, of the jump graph , is the minimum cardinality of the union of two disjoint connected dominating set of . In this paper we have established bounds, exact values of and graph theoretic relations between the inverse connected domination number of the jump graph with other parameters of G.