Abstract
Domination in graphs has become one of the major areas of graph theory with extensive applications in design and analysis of communication networks, computational complexity, and algorithm design. This paper mainly research on domination number and bondage number of the graph, especially, these parameters measure to some extent the robustness of an interconnection network with respect to link failures. By constructing a family of minimum dominating sets we compute the domination number and bondage number of the sun graph.
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 callDisclaimer: 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.
