Back to Search
Start Over
Some results on spanning trees.
- Source :
- Acta Mathematicae Applicatae Sinica; Oct2010, Vol. 26 Issue 4, p607-616, 10p, 1 Chart, 1 Graph
- Publication Year :
- 2010
-
Abstract
- Some structures of spanning trees with many or less leaves in a connected graph are determined. We show (1) a connected graph G has a spanning tree T with minimum leaves such that T contains a longest path, and (2) a connected graph G on n vertices contains a spanning tree T with the maximum leaves such that Δ( G) = Δ( T) and the number of leaves of T is not greater than n − D( G) + 1, where D( G) is the diameter of G. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01689673
- Volume :
- 26
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Acta Mathematicae Applicatae Sinica
- Publication Type :
- Academic Journal
- Accession number :
- 53450296
- Full Text :
- https://doi.org/10.1007/s10255-010-0011-4