A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree strictly greater than two. This paper shows two degree conditions for graphs to have spanning trees with total bounded number of branch vertices and leaves. Moreover, the sharpness of our results is shown.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics