Enumeration of structure-sensitive graphical subsets: Calculations

DOI10.1073/pnas.78.3.1329zbMath0457.05061OpenAlexW2142728677WikidataQ35316803 ScholiaQ35316803MaRDI QIDQ3905332

R. E. Merrifield, H. E. Simmons

Publication date: 1981

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.78.3.1329

zbMATH Keywords

numerical calculationsstructure-sensitive graphical subsets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graph theory (05C99)

Related Items (14)

The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain ⋮ Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices ⋮ Cacti with the maximum Merrifield-Simmons index and given number of cut edges ⋮ Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ Counting maximal independent sets in some \(n\)-gonal cacti ⋮ Domino tilings of the expanded Aztec diamond ⋮ Domino tilings of Aztec octagons ⋮ Unicycle graphs with extremal Merrifield-Simmons index ⋮ The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices ⋮ Enumerating independent vertex sets in grid graphs ⋮ Domino tilings for augmented Aztec rectangles and their chains ⋮ A sharp upper bound for the number of stable sets in graphs with given number of cut edges ⋮ Computing the Merrifield-Simmons indices of benzenoid chains and double benzenoid chains ⋮ Spatial patterns in nonequilibrium hierarchical systems

This page was built for publication: Enumeration of structure-sensitive graphical subsets: Calculations