Abstract
A set D of vertices in a graph G (V, E) is a dominating set of G, if every vertex in V-D is adjacent to at least one vertex in D. If V-D contains a dominatingset D’ of G then D’ is called an inverse dominating set with respect to D. In this paper we have established some theorems and properties of the inverse domination number to the transformation of path related graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
