On the maximum mean subtree order of trees

DOI10.1016/j.ejc.2021.103388zbMath1469.05030arXiv2010.15522OpenAlexW3179099540MaRDI QIDQ2048363

Stijn Cambie, Hua Wang, Stephan G. Wagner

Publication date: 5 August 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.15522

zbMATH Keywords

subtree densitymean subtree order of a tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Related Items (7)

Maximum number of subtrees in cacti and block graphs ⋮ On the mean subtree order of trees under edge contraction ⋮ Random subtrees and unimodal sequences in graphs ⋮ The number and average size of connected sets in graphs with degree constraints ⋮ Solution to a conjecture on the mean subtree order of graphs under edge addition ⋮ Decreasing the mean subtree order by adding k edges ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees

Cites Work

• Unnamed Item
• Extremal results on average subtree density of series-reduced trees
• Indistinguishable trees and graphs
• Monotonicity of the mean order of subtrees
• The average order of a subtree of a tree
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• On the Local and Global Means of Subtree Orders
• Maximizing the mean subtree order

This page was built for publication: On the maximum mean subtree order of trees