Mathematical Sciences: Faculty Presentations (1991-2022)
Subtrees, Degree Sequence and Partial Ordering of the Optimal Trees
Document Type
Presentation
Presentation Date
4-1-2011
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.
Abstract or Description
The subtrees of a tree have been studied from various points of view. In particular, the extremal trees that maximize the number of subtrees were identified for different categories of trees such as binary trees and trees with a given maximum degree. We extend these results to trees with given degree sequences. Furthermore, an ordering of the extremal trees with different degree sequence is provided. This ordering provides a relatively easy way to identify extremal trees. Some of the previously know results follow as corollaries.
Sponsorship/Conference/Institution
Mathematical Association of America Southeastern Section Annual Meeting (MAA-SE)
Location
Tuscaloosa, AL
Recommended Citation
Wang, Hua.
2011.
"Subtrees, Degree Sequence and Partial Ordering of the Optimal Trees."
Mathematical Sciences: Faculty Presentations (1991-2022).
Presentation 535.
https://digitalcommons.georgiasouthern.edu/math-sci-facpres/535
