Back to Search
Start Over
Spanning Trees with many Leaves: New Lower Bounds in Terms of the Number of Vertices of Degree 3 and at Least 4.
- Source :
-
Journal of Mathematical Sciences . Feb2014, Vol. 196 Issue 6, p747-767. 21p. - Publication Year :
- 2014
-
Abstract
- It is proved that every connected graph with s vertices of degree 3 and t vertices of degree at least 4 has a spanning tree with $ \frac{2}{5}t+\frac{1}{5}s+\alpha $ leaves, where $ \alpha \geq \frac{8}{5} $. Moreover, α ≥ 2 for all graphs, except for three exclusions. All exclusions are regular graphs of degree 4, and they are explicitly described in the paper. An infinite series of graphs containing only vertices of degree 3 and 4, for which the maximal number of leaves in a spanning tree is equal to $ \frac{2}{5}t+\frac{1}{5}s+2 $, is presented. Therefore it is proved that the bound is tight. Bibliography: 12 titles. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10723374
- Volume :
- 196
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Journal of Mathematical Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 93893253
- Full Text :
- https://doi.org/10.1007/s10958-014-1691-8