arXiv Analytics

Sign in

arXiv:1209.0273 [math.CO]AbstractReferencesReviewsResources

Trees with given degree sequences that have minimal subtrees

Xiu-Mei Zhang, Xiao-Dong Zhang

Published 2012-09-03Version 1

In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in general not unique. Moreover, all extremal trees with a given degree sequence $\pi=(d_1, ..., d_5, 1,..., 1)$ have been characterized.

Comments: 11 pages
Categories: math.CO
Subjects: 05C50, 05C35
Related articles: Most relevant | Search more
arXiv:1302.1687 [math.CO] (Published 2013-02-07)
A TurĂ¡n-type problem on degree sequence
arXiv:0804.2776 [math.CO] (Published 2008-04-17)
Largest Laplacian Eigenvalue and Degree Sequences of Trees
arXiv:1304.4696 [math.CO] (Published 2013-04-17)
Spectral moments of trees with given degree sequence