On the mean subtree order of trees under edge contraction

DOI10.1002/jgt.22885zbMath1522.05037OpenAlexW4295242214MaRDI QIDQ6046687

Stephan G. Wagner, Hua Wang, Zuwen Luo, Kexiang Xu

Publication date: 6 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-496935

zbMATH Keywords

treeedge contractionsubtreemean subtree order

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (4)

Random subtrees and unimodal sequences in graphs ⋮ 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

• 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 maximum mean subtree order of trees
• On the Local and Global Means of Subtree Orders
• Maximizing the mean subtree order

This page was built for publication: On the mean subtree order of trees under edge contraction