On the mean subtree order of graphs under edge addition

DOI10.1002/jgt.22621zbMath1521.05020arXiv1911.05794OpenAlexW3088594123MaRDI QIDQ6055400

L. A. S. Mól, Ben Cameron

Publication date: 29 September 2023

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

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

zbMATH Keywords

subtreemean subtree order

Mathematics Subject Classification ID

Trees (05C05)

Related Items (9)

On the probability that a random subtree is spanning ⋮ The node cop‐win reliability of unicyclic and bicyclic graphs ⋮ Extremal graphs for average sizes of maximal matchings ⋮ 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 ⋮ On the average order of a dominating set of a forest

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
• The average size of independent sets of graphs
• On the Local and Global Means of Subtree Orders
• Subtrees of graphs
• Maximizing the mean subtree order

This page was built for publication: On the mean subtree order of graphs under edge addition