The Average Order of a Subtree of a Tree
Document Type
Presentation
Presentation Date
10-24-2008
Abstract or Description
Let T be a tree all of whose internal vertices have degree at least three. We show that the average order of a subtree of T is at least half the order of T, proving a conjecture raised by Jamison in 1983. It is also shown that the average order of a subtree of T is at most three quarters the order of T. Some open questions will be stated as well.
Sponsorship/Conference/Institution
Fall Southeastern Sectional Meeting of the American Mathematical Society (AMS)
Location
Huntsville, AL
Recommended Citation
Wang, Hua.
2008.
"The Average Order of a Subtree of a Tree."
Department of Mathematical Sciences Faculty Presentations.
Presentation 536.
https://digitalcommons.georgiasouthern.edu/math-sci-facpres/536