Extremal results on average subtree density of series-reduced trees

DOI10.1016/j.jctb.2014.02.003zbMath1298.05066arXiv1312.7233OpenAlexW2949912983MaRDI QIDQ403359

John Haslegrave

Publication date: 29 August 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

average ordersubtreeextremal sequenceseries-reduced tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Related Items (28)

On the eccentric subtree number in trees ⋮ Minimum status of series-reduced trees with given parameters ⋮ 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 ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ On the roots of the subtree polynomial ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ The average order of dominating sets of a graph ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ Which numbers are status differences? ⋮ The distance spectral radius of trees ⋮ Trees with large numbers of subtrees ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ 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 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

• The number of homeomorphically irreducible trees, and other species
• The average order of a subtree of a tree
• On the average number of nodes in a subtree of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal results on average subtree density of series-reduced trees