Largest Number of Subtrees of Trees with a Given Maximum Degree
Document Type
Article
Publication Date
5-30-2008
Publication Title
SIAM Journal on Discrete Mathematics
DOI
10.1137/070687736
ISSN
1095-7146
Abstract
We characterize trees, given a size and maximum vertex degree, which have the greatest number of subtrees. This generalizes the recent result of Szekely and Wang. These trees coincide with those which were shown by Fischermann et al., and independently Jelen and Triesch, to minimize the Wiener index.
Recommended Citation
Kirk, Russell, Hua Wang.
2008.
"Largest Number of Subtrees of Trees with a Given Maximum Degree."
SIAM Journal on Discrete Mathematics, 22 (3): 985-995.
doi: 10.1137/070687736
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/712
COinS
