Abstract
Let G=(V,E) be a simple graph without isolated vertices. A set S⊆V is called a paired-dominating set if every vertex in V∖S has at least one neighbor in S and the subgraph induced by S contains a perfect matching. The paired-domination number of G, denoted by γpr(G), is the minimum cardinality of a paired-dominating set of G. We show that γpr(G)≤4n∕7 if G is a claw-free graph of order n with minimum degree at least three. The statement partly confirms the conjecture proposed by Goddard and Henning in 2009.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.