Abstract
AbstractA total dominating set in a graph is a set of vertices of such that every vertex is adjacent to a vertex of the set. The total domination number is the minimum cardinality of a total dominating set in . In this paper, we study the following open problem posed by Yeo. For each , find the smallest value, , such that every connected graph of order at least 3, of order , size , total domination number , and bounded maximum degree , satisfies . Henning showed that for all . Yeo significantly improved this result and showed that for all , and posed as an open problem to determine “whether grows proportionally with or or some completely different function.” In this paper, we determine the growth of , and show that is asymptotically and likewise determine the asymptotics of the analogous constant for standard domination.
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.
