Decreasing the mean subtree order by adding k edges

DOI10.1002/jgt.23043arXiv2308.12808MaRDI QIDQ6144910

Unnamed Author, Yanli Hao, Guantao Chen, Stijn Cambie

Publication date: 30 January 2024

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

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

zbMATH Keywords

subtreemean subtree order

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

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 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
• Subtrees of graphs
• Maximizing the mean subtree order
• On the mean subtree order of trees under edge contraction
• On the mean subtree order of graphs under edge addition

This page was built for publication: Decreasing the mean subtree order by adding k edges