Inverse Connected and Disjoint Connected Domination Number of a Jump Graph

Authors

  • Annie Jasmine.S.E

  • K. Ameenal Bibi

How to Cite

Jasmine.S.E, A., & Ameenal Bibi, K. (2018). Inverse Connected and Disjoint Connected Domination Number of a Jump Graph. International Journal of Engineering and Technology, 7(4.10), 585-588. https://doi.org/10.14419/ijet.v7i4.10.21288

Received date: October 8, 2018

Accepted date: October 8, 2018

Published date: October 2, 2018

DOI:

https://doi.org/10.14419/ijet.v7i4.10.21288

Keywords:

Domination number of a jump graph, Inverse domination number of a jump graph, connected domination number of a jump graph, Inverse connected dominating set and Inverse connected Domination number of a jump graph, Well dominating number of a jump graph, D

Abstract

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.     

 

 

References

  1. [1] Sampathkumar, E.;Wailkar, HB , The connected domination number of a graph, J Math. Phys. Sci 13(6):1979, PP607-613.

    [2] Y.B. Maralabhavi, Anupama S.B., Venganagouda M. Goudar, Domination number of Jump graph, International Mathematical Forum, Vol 8, No. 16, PP 753-758 (2013).

    [3] M. Karthikeyan, A. Elumalai, Inverse domination number of a Jump graph, International journal of pure and applied mathematics, Vol 103, No. 3, (2015),PP 477-483.

    [4] Anupama S.B., Y.B. Maralabhavi, Venganagouda M. Goudar, Connected domination number of Jump graph, Journal of computer and mathematical sciences, Vol. 6(10), PP 538-545.

    [5] V.R.Kulli and S.C.Sigarkanti, Inverse domination in Graphs, Nat. Acad. Sci. Lett., 14 (1991 ), PP 473-475.

    [6] G.S. Domke, J.E. Dunbar and L.R. Markus, The inverse domination number of a graph, Ars Combin., 72 -2004 PP 149-160.

    [7] V.R. Kulli, College graph theory, Vishwa International publications, Gulbarga, India (2012 ).

    [8] V.R. Kulli, Theory of domination in graphs, Vishwa International publications, Gulbarga, India (2010 ).

Downloads

How to Cite

Jasmine.S.E, A., & Ameenal Bibi, K. (2018). Inverse Connected and Disjoint Connected Domination Number of a Jump Graph. International Journal of Engineering and Technology, 7(4.10), 585-588. https://doi.org/10.14419/ijet.v7i4.10.21288

Received date: October 8, 2018

Accepted date: October 8, 2018

Published date: October 2, 2018