The average order of a subtree of a tree

DOI10.1016/J.JCTB.2009.05.006MaRDI QIDQ965244zbMATH OpenOpenAlexFDO

Authors Andrew Vince, Hua Wang

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

zbMATH Keywords

subtreeaverage order

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• The mean order of sub-\(k\)-trees of \(k\)-trees
• On the maximum mean subtree order of trees
• On the distribution of subtree orders of a tree
• Monotonicity of the mean order of subtrees
• scientific article; zbMATH DE number 3849285
• Maximizing the mean subtree order
• On the mean subtree order of trees under edge contraction
• Publication:4730334
• ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
• On the average order of a dominating set of a forest

Cites work

• scientific article; zbMATH DE number 3849252 (Why is no real title available?)
• On the average number of nodes in a subtree of a tree

Cited in

(41)

• On the mean connected induced subgraph order of cographs
• On the maximum mean subtree order of trees
• Random subtrees and unimodal sequences in graphs
• On the eccentric subtree number in trees
• On the mean subtree order of trees under edge contraction
• On the mean order of connected induced subgraphs of block graphs
• The average order of dominating sets of a graph
• The ratio of the numbers of odd and even cycles in outerplanar graphs
• Maximizing the mean subtree order
• The average size of a connected vertex set of a graph—Explicit formulas and open problems
• The minimal number of subtrees with a given degree sequence
• On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
• On the roots of the subtree polynomial
• On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree
• Decreasing the mean subtree order by adding k edges
• Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
• scientific article; zbMATH DE number 3849285 (Why is no real title available?)
• Extremal results on average subtree density of series-reduced trees
• The number of subtrees of trees with given diameter
• The path minimises the average size of a connected induced subgraph
• The number and average size of connected sets in graphs with degree constraints
• On the average order of a dominating set of a forest
• Solution to a conjecture on the mean subtree order of graphs under edge addition
• On the difference of mean subtree orders under edge contraction
• Central limit theorems for additive tree parameters with small toll functions
• On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
• Computing the number and average size of connected sets in planar 3-trees
• The expected subtree number index in random polyphenylene and spiro chains
• On the probability that a random subtree is spanning
• A lower bound on the average size of a connected vertex set of a graph
• Greedy trees, subtrees and antichains
• The average size of matchings in graphs
• A tight upper bound on the average order of dominating sets of a graph
• On the mean subtree order of graphs under edge addition
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• The average size of a connected vertex set of a \(k\)-connected graph
• On the local and global means of subtree orders
• Subtrees of spiro and polyphenyl hexagonal chains
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
• The average size of independent sets of graphs

This page was built for publication: The average order of a subtree of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965244)