Abstract
In this research paper, we initiate a study of such questions in the present context of total domination theory within graph theory from new perspectives and results concerned with formal definitions, mathematical formulations, theorems and practical applications. Description Total domination is a tool used to determine the graph that has minimum number of vertices can monitor or control all other vertices - factors of interest for problems related, amongst others fields as network optimization and resilience analysis. This paper covers fundamental definitions as well their most recent theoretical bounds, algorithmic complexities and practical examples arising in applications from the real world. The obtained results could be helpful in deciphering, exploiting and administering the concept of total domination further.
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: REST Journal on Emerging trends in Modelling and Manufacturing
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.
