Enumeration of structure-sensitive graphical subsets: Theory

DOI10.1073/PNAS.78.2.692MaRDI QIDQ3893958zbMATH OpenOpenAlexWikidataFDO

Authors 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.2.692

zbMATH Keywords

connected setsenumerationexternally stable setsindependent setsirredundant setskernelsline coverspoint coversvertex sets

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cited in

(17)

• A sharp upper bound for the number of stable sets in graphs with given number of cut edges
• Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices
• Domino tilings of the expanded Aztec diamond
• State matrix recursion method and monomer-dimer problem
• Domino tilings for augmented Aztec rectangles and their chains
• Computing the Merrifield-Simmons indices of benzenoid chains and double benzenoid chains
• An algorithm for calculating the independence and vertex-cover polynomials of a graph
• Maximal independent sets on a grid graph
• Domino tilings of Aztec octagons
• The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain
• Enumerating independent vertex sets in grid graphs
• Cacti with the maximum Merrifield-Simmons index and given number of cut edges
• Augmented Aztec bipyramid and dicube tilings
• Counting maximal independent sets in some \(n\)-gonal cacti
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Unicycle graphs with extremal Merrifield-Simmons index
• The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices

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

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