The number of homeomorphically irreducible trees, and other species

DOI10.1007/BF02559543zbMath0084.19304OpenAlexW2075167911MaRDI QIDQ770044

Frank Harary, Geert C. E. Prins

Publication date: 1959

Published in: Acta Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02559543

zbMATH Keywords

topology

Related Items (31)

On nodes of degree two in random trees ⋮ On the number of broadcast schemes in networks ⋮ The number of plane trees with a given partition ⋮ Universal expansion of the powers of a derivation ⋮ The enumeration of tree-like polyhexes ⋮ Minimum status of series-reduced trees with given parameters ⋮ Enumeration of (uni- or bicolored) plane trees according to their degree distribution ⋮ Extremal results on average subtree density of series-reduced trees ⋮ Cubic identity graphs and planar graphs derived from trees ⋮ Homeomorphically irreducible spanning trees ⋮ The sets of star and semistar operations on semilocal Prüfer domains ⋮ An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees ⋮ Superposition of snarks revisited ⋮ On asymmetric structures ⋮ The distance spectral radius of trees ⋮ Counting asymmetric enriched trees ⋮ On the symmetry and asymmetry of combinatorial structures ⋮ The distribution of degrees in a large random tree ⋮ On the Edge-sets of Rigid and Corigid Graphs ⋮ The blossoming of Schröder's fourth problem ⋮ Asymptotic formulas for the enumerator of trees with a given number of hanging or internal vertices ⋮ The probability that a point of a tree is fixed ⋮ A Stability Theorem for Minimum Edge Graphs with Given Abstract Automorphism Group ⋮ The number of functional digraphs ⋮ On the enumeration of finite maximal connected topologies ⋮ The least number of edges for graphs having dihedral automorphism group ⋮ Theory of path length distributions. I ⋮ Hereditarily finite sets and identity trees ⋮ Spanning trees without adjacent vertices of degree 2 ⋮ Estimation of the neutral mutation rate in a finite population from DNA sequence data ⋮ On acyclic simplicial complexes

Cites Work

• Note on the Polya and Otter formulas for enumerating trees
• The numbers of labeled colored and chromatic trees
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• The number of trees
• The dissimilarity characteristic of Husimi trees
• On the notion of balance of a signed graph
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Enumeration Of Labelled Graphs
• On the Number of Husimi Trees
• The Dissimilarity Characteristic of Linear Graphs
• The Number of Linear, Directed, Rooted, and Connected Graphs

This page was built for publication: The number of homeomorphically irreducible trees, and other species