Abstract
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees with a given degree sequence. This is a question naturally related to the extremal structures of some distance based graph invariants. We first confirm the expected fact that the number of subtrees is minimized by some caterpillar. As with other graph invariants, the specific optimal caterpillar is nearly impossible to characterize and depends on the degree sequence. We provide some simple properties of such caterpillars as well as observations that will help finding the optimal caterpillar.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Çela E., Schmuck N.S., Wimer S., Woeginger G.J.: The Wiener maximum quadratic assignment problem. Discret. Optim. 8, 411–416 (2011)
Dobrynin A., Entringer R., Gutman I.: Wiener index of trees: theory and applications. Acta Appl. Math 66, 211–249 (2001)
Fischermann M., Hoffmann A., Rautenbach D., Székely L., Volkmann L.: Wiener index versus maximum degree in trees. Discret. Appl. Math 122, 127–137 (2002)
Gutman I.: A property of the Wiener number and its modifications. Indian J. Chem. Sec. A 36, 128–132 (1997)
Heuberger C., Prodinger H.: On α-greedy expansions of numbers. Adv. Appl. Math 38(4), 505–525 (2007)
Knudsen, B.: Optimal multiple parsimony alignment with affine gap cost using a phylogenetic tree. Lecture Notes in Bioinformatics, vol. 2812, pp. 433–446. Springer, Berlin (2003)
Li, S., Wang, S.: Further analysis on the total number of subtrees of trees, arXiv:1204.6152 (2012)
Li, S., Wang, S.: Enumerating the total number of subtrees of trees, arXiv:1206.2975 (2012)
Sills A., Wang H.: On the maximal Wiener index and related questions. Discret. Appl. Math 160, 1615–1623 (2012)
Szekely L.A., Wang H.: On subtrees of trees. Adv. Appl. Math. 34, 138–155 (2005)
Wagner S.: Correlation of graph-theoretical indices. SIAM J. Discret. Math. 21(1), 33–46 (2007)
Wang, H.: The extremal values of the Wiener index of a tree with given degree sequence. Discret. Appl. Math. 156 (2008)(14), 2647–2654 (Corrigendum, Discrete Appl. Math. 157(18), 3754 (2009))
Wiener H.: Structural determination of paraffin boiling point. J. Am. Chem. Soc 69, 17–20 (1947)
Zhang X.-D., Xiang Q.-Y., Xu L.-Q., Pan R.-Y.: The Wiener index of trees with given degree sequences. MATCH Commun. Math. Comput. Chem 60, 623–644 (2008)
Zhang X.-D., Liu Y., Han M.-X.: Maximum wiener index of trees with given degree sequence. MATCH Commun. Math. Comput. Chem. 64, 661–682 (2010)
Zhang, X.-M., Zhang, X.-D.: Minimal number of subtrees with a given degree sequence. Graphs Comb. (2013) (to appear)
Zhang, X.-M., Zhang, X.-D., Gray, D., Wang, H.: The number of subtrees of trees with given degree sequence. J. Graph Theory (2012). doi:10.1002/jgt.21674
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by a grant from the Simons Foundation (#245307) to Hua Wang.
Rights and permissions
About this article
Cite this article
Sills, A.V., Wang, H. The Minimal Number of Subtrees of a Tree. Graphs and Combinatorics 31, 255–264 (2015). https://doi.org/10.1007/s00373-013-1376-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-013-1376-y