Mathematical Sciences: Faculty Publications

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.

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Share

COinS