Abstract
In this paper, we show that the power domination number of a connected 4-regular claw-free graph on n vertices is at most n+15, and the bound is sharp. The statement disproves the conjecture presented by Dorbec et al. (2013).
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.
