Article ID Journal Published Year Pages File Type
4647132 Discrete Mathematics 2016 4 Pages PDF
Abstract

Rivera-Campo provided a degree sum condition for a graph to have a spanning tree with bounded degrees and leaves. In this paper, we give an independence number condition for a graph to have a spanning tree with bounded degrees and leaves, which also partially solves the conjecture made by Enomoto and Ozeki (2010).

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Spanning trees with bounded degrees and leaves
Authors
, ,