The enumeration of tree-like polyhexes

DOI10.1017/S0013091500009135zbMath0201.26104OpenAlexW2119204035MaRDI QIDQ5598929

Ronald C. Read, Frank Harary

Publication date: 1970

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0013091500009135

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items

Pentagonal chains and annuli as models for designing nanostructures from cages, Evaluating efficiency of self-reconfiguration in a class of modular robots, Several explicit and recursive formulas for generalized Motzkin numbers, Some asymptotic results useful in enumeration problems, Cubical graphs and cubical dimensions, Algebraic solution for the numbers of staggered conformers of alkanes, Chemistry and discrete mathematics, Circumscribing certain polygonal systems, Matrix identities on weighted partial Motzkin paths, Infinitely log-monotonic combinatorial sequences, A criterion for the log-convexity of combinatorial sequences, The uplift principle for ordered trees, Jumping succession rules and their generating functions, Saturated fully leafed tree-like polyforms and polycubes, On the enumeration of planar trees of hexagons, Note on the asymptotic isomer count of large fullerenes, Several identities in the Catalan triangle, Enumerating stereo-isomers of tree-like polyinositols, A polyominoes-permutations injection and tree-like convex polyominoes, Enumerating tree-like polyphenyl isomers, On the log-convexity of combinatorial sequences, Two explicit formulas for the generalized Motzkin numbers, Skew Dyck paths, Riordan matrices and higher-dimensional lattice walks, On the cell-growth problem for arbitrary polygons, Congruences for Catalan and Motzkin numbers and related sequences, Skew Dyck paths, area, and superdiagonal bargraphs, Production matrices, The growth rate of high-dimensional tree polycubes, A refined enumeration of hex trees and related polynomials, Unnamed Item, The enumeration of several classes of hexagonal systems, Unnamed Item, The signs of three-term recurrence sequences, The fine numbers refined, Unnamed Item, Catalan-like numbers and determinants, Hankel determinants of linear combinations of moments of orthogonal polynomials

Cites Work

• The number of homeomorphically irreducible trees, and other species
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• The number of trees
• Dissimilarity Characteristic Theorems for Graphs
• The Number of Linear, Directed, Rooted, and Connected Graphs