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).

Full Text
Published version (Free)

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 call