Abstract
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 Dof J(G), then Dis 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Pure and Apllied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
