Maximizing the mean subtree order
From MaRDI portal
Publication:5229538
DOI10.1002/jgt.22434zbMath1417.05031arXiv1707.01874OpenAlexW2964114505WikidataQ128821669 ScholiaQ128821669MaRDI QIDQ5229538
Ortrud R. Oellermann, L. A. S. Mól
Publication date: 15 August 2019
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.01874
Related Items (20)
On the eccentric subtree number in trees ⋮ On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees ⋮ The average size of matchings in graphs ⋮ A lower bound on the average size of a connected vertex set of a graph ⋮ The average size of independent sets of graphs ⋮ On the mean subtree order of trees under edge contraction ⋮ On the mean subtree order of graphs under edge addition ⋮ The average size of a connected vertex set of a graph—Explicit formulas and open problems ⋮ On the probability that a random subtree is spanning ⋮ 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 roots of the subtree polynomial ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ On the Mean Order of Connected Induced Subgraphs of Block Graphs ⋮ The average size of a connected vertex set of a \(k\)-connected graph ⋮ On the maximum mean subtree order of trees ⋮ On the Mean Connected Induced Subgraph Order of Cographs ⋮ On the average order of a dominating set of a forest
This page was built for publication: Maximizing the mean subtree order
