Abstract
We obtain new upper bounds on the size of a minimum total dominating set for random regular graphs and for regular graphs with large girth. In particular, they imply that an upper bound conjectured by Thomassé and Yeo (2007) holds asymptotically almost surely for 5-regular graphs and holds for all 5-regular graphs with sufficiently large girth. Our bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and Wormald (2018).
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.
