On the Local and Global Means of Subtree Orders
From MaRDI portal
Publication:3466362
DOI10.1002/jgt.21869zbMath1330.05043OpenAlexW1800116691MaRDI QIDQ3466362
Publication date: 1 February 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21869
Related Items (22)
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 ⋮ The number of subtrees of trees with given diameter ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ The average order of dominating sets of a graph ⋮ 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 ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
Cites Work
This page was built for publication: On the Local and Global Means of Subtree Orders
