On the Local and Global Means of Subtree Orders. Issue 2 (14th April 2015)

• Record Type: Journal Article
• Authors: Wagner, Stephan; Wang, Hua
• Is Part Of: Journal of graph theory. Volume 81:Issue 2(2016)
• Page Start: 154
• Page End: 166
• Publication Date: 2015-04-14
• Subjects: subtrees -- mean order -- local mean -- global mean -- homeomorphically irreducible trees; Graph theory -- Periodicals; 511
• DOI: 10.1002/jgt.21869
• Languages: English
• ISSNs: 0364-9024

Abstract

Abstract: The global mean of subtrees of a tree is the average order (i.e., average number of vertices) of its subtrees. Analogously, the local mean of a vertex in a tree is the average order of subtrees containing this vertex. In the comprehensive study of these concepts by Jamison (J Combin Theory Ser B 35 (1983), 207–223 and J Combin Theory Ser B 37 (1984), 70–78), several open questions were proposed. One of them asks if the largest local mean always occurs at a leaf vertex. Another asks if it is true that the local mean of any vertex of any tree is at most twice the global mean. In this note, we answer the first question by showing that the largest local mean always occurs at a leaf or a vertex of degree 2 and that both cases are possible. With this result, a positive answer to the second question is provided. We also show some related results on local mean and global mean of trees.