Abstract
Let G=(V, E) be a graph. Let D be a minimum total dominating set of G. If V–D contains a total dominating set D’ of G, then D’ is called an inverse total dominating set with respect to D. The inverse total domination number of G is the minimum number of vertices in an inverse total dominating set of G. We initiate the study of inverse total domination in graphs and present some bounds and some exact values for . Also, some relationships between and other domination parameters are established.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Discrete Mathematical Sciences and Cryptography
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.