Abstract
In this study, we engrossed to find a litact graph of a given graph which is acquired by considering the cut vertices as well as the edge set of the graph as its vertex set and their corresponding incidence and adjacency in the respective graph among them will be the edge set. The study further extended to find a new domination variant inverse domination number for a litact graph named “Inverse litact domination in graphs”. In addition to it the inverse litact domination of some graphs or families of graphs are achieved and some limits in terms of different parameters of the graph along with the Nordhaus- Gaddum types of results are also obtained.
Sign-in/Register to access full text options 
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
