Abstract
A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree at least three. In this paper, we show a degree condition for a claw-free graph to have spanning trees with at most five branch vertices and leaves in total. Moreover, the degree sum condition is best possible.
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.
