Enumeration of structure-sensitive graphical subsets: Theory
From MaRDI portal
Publication:3893958
DOI10.1073/pnas.78.2.692zbMath0448.05035OpenAlexW2052011826WikidataQ35412617 ScholiaQ35412617MaRDI QIDQ3893958
H. E. Simmons, R. E. Merrifield
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
enumerationkernelsindependent setsline coversconnected setspoint coversexternally stable setsirredundant setsvertex sets
Related Items (17)
The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain ⋮ An algorithm for calculating the independence and vertex-cover polynomials of a graph ⋮ Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices ⋮ Maximal independent sets on a grid graph ⋮ 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 ⋮ Augmented Aztec bipyramid and dicube tilings ⋮ 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 ⋮ State matrix recursion method and monomer-dimer problem ⋮ 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
This page was built for publication: Enumeration of structure-sensitive graphical subsets: Theory
