scientific article

zbMath0535.05024MaRDI QIDQ3318794

A. Meir, John W. Moon

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

rooted treeenumeration of subtrees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Related Items (12)

Enumeration problems for classes of self-similar graphs ⋮ On the number of induced subgraphs of trees ⋮ Alternating Whitney sums and matchings in trees. 1 ⋮ On the Local and Global Means of Subtree Orders ⋮ The average size of a connected vertex set of a graph—Explicit formulas and open problems ⋮ Extremal results on average subtree density of series-reduced trees ⋮ The number and average size of connected sets in graphs with degree constraints ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ The minimal number of subtrees with a given degree sequence ⋮ The average order of a subtree of a tree ⋮ On an asymptotic method in enumeration ⋮ The path minimises the average size of a connected induced subgraph

This page was built for publication: