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.
Full Text
Sign-in/Register to access full text options
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