The average order of a subtree of a tree
From MaRDI portal
Publication:965244
DOI10.1016/j.jctb.2009.05.006zbMath1216.05011OpenAlexW2170640916MaRDI QIDQ965244
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.05.006
Related Items (35)
On the eccentric subtree number in trees ⋮ On the Local and Global Means of Subtree Orders ⋮ 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 ⋮ Greedy trees, subtrees and antichains ⋮ 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 ⋮ Extremal results on average subtree density of series-reduced trees ⋮ 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 ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Decreasing the mean subtree order by adding k edges ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ On the roots of the subtree polynomial ⋮ The number of subtrees of trees with given diameter ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ The average order of dominating sets of a graph ⋮ The minimal number of subtrees with a given degree sequence ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ On the Mean Order of Connected Induced Subgraphs of Block Graphs ⋮ Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees ⋮ 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 ⋮ The path minimises the average size of a connected induced subgraph
Cites Work
This page was built for publication: The average order of a subtree of a tree
