The enumeration of tree-like polyhexes

DOI10.1017/S0013091500009135MaRDI QIDQ5598929zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(45)

• The fine numbers refined
• Some asymptotic results useful in enumeration problems
• Cubical graphs and cubical dimensions
• On the cell-growth problem for arbitrary polygons
• Catalan-like numbers and determinants
• Algebraic solution for the numbers of staggered conformers of alkanes
• Jumping succession rules and their generating functions
• Saturated fully leafed tree-like polyforms and polycubes
• Production matrices
• The enumeration of several classes of hexagonal systems
• Chemistry and discrete mathematics
• Circumscribing certain polygonal systems
• Several identities in the Catalan triangle
• Several explicit and recursive formulas for generalized Motzkin numbers
• Skew Dyck paths, area, and superdiagonal bargraphs
• Note on the asymptotic isomer count of large fullerenes
• On the log-convexity of combinatorial sequences
• Congruences for Catalan and Motzkin numbers and related sequences
• The growth rate of high-dimensional tree polycubes
• Pentagonal chains and annuli as models for designing nanostructures from cages
• Enumerating tree-like polyphenyl isomers
• Infinitely log-monotonic combinatorial sequences
• A criterion for the log-convexity of combinatorial sequences
• On the enumeration of planar trees of hexagons
• The uplift principle for ordered trees
• Evaluating efficiency of self-reconfiguration in a class of modular robots
• scientific article; zbMATH DE number 1122698 (Why is no real title available?)
• New sufficient conditions for log-balancedness, with applications to combinatorial sequences
• Enumerating stereo-isomers of tree-like polyinositols
• scientific article; zbMATH DE number 7309235 (Why is no real title available?)
• Two explicit formulas for the generalized Motzkin numbers
• scientific article; zbMATH DE number 3893225 (Why is no real title available?)
• The log-behavior of the sequence for the partial sum of a log-convex sequence
• Hankel determinants of linear combinations of moments of orthogonal polynomials
• A refined enumeration of hex trees and related polynomials
• Fusene chains revisited: how kinky they are and why it matters
• A polyominoes-permutations injection and tree-like convex polyominoes
• Several sufficient conditions for the log-balancedness of the difference sequence of a log-convex sequence
• On the convergent and null generalized Motzkin sequence spaces
• Some topological and geometric properties of novel generalized Motzkin sequence spaces
• A walk in my lattice path garden
• The signs of three-term recurrence sequences
• Matrix identities on weighted partial Motzkin paths
• Skew Dyck paths
• Riordan matrices and higher-dimensional lattice walks

This page was built for publication: The enumeration of tree-like polyhexes

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