Inverse Domination Parameters of Jump Graph

S Santha, G.T Krishna Veni

Abstract


Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D. Theminimum cardinality of an inverse dominating set of G is called inverse domination number of G. In this article, we determine inverse domination parameters of jump graph of a graph.

Keywords


dominating set, labeling, digraphs, di-cyclic, di-Quadrilateral, di-Pentagonal, snake.

Full Text:

PDF

References


T.W. Haynes. S.T. Hedetniemi, P.J. Slater, FUNDAMENTALS OF DOMINATI-ON IN GRAPH, Marcel Dekkar, New York,1998.

V. R. Kulli, S.C. Sigarkanthi, INVERSE DOMINATION IN GRAPH, Nat. Acad. Sci. Letters, 14, 473-475, 1991.

Allan R.B., R. C. Laskar, ON DOMINATION INVERSE DOMINATION NUMBERS OF A GRAPH, Discrete Math.,23, ,73-76, 1978.

E.J. Cockayne, Hedetniemi., TOWARDS A THEORY OF DOMINATION IN GRAPHS, Networks, 7, 247-261, 1997.

J.A. Bondy, U.S.R. Murty, GRAPH THEORY WITH APPLICATIONS, North Holland, New York.

Dr. S. Meena, K. Vaithilingan, PRIME LABELING FOR SOME FAN RELATED GRAPHS, International Journal Of Engineering Research and Technology (IJERT), 9, 2278-0181, 2012.

Y.B. Maralabhavi et.al., DOMINATION NUMBER OF JUMP GRAPH, Intn. Mathematical Forum, vol8, 753-758. 2013.

M. Karthikeyan, A. Elumalai, INVERSE DOMINATION NUMBER OF JUMP GRAPH. Intn. joum. pure and applied maths vol 103 No.3, 477-483 100 – 102, 2015.




DOI: http://dx.doi.org/10.23755/rm.v45i0.1001

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Santha S, Krishna Veni G.T

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.