Enumeration of structure-sensitive graphical subsets: Theory

DOI10.1073/pnas.78.2.692zbMath0448.05035WikidataQ35412617 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

zbMATH Keywords

enumeration; kernels; independent sets; line covers; connected sets; point covers; externally stable sets; irredundant sets; vertex sets

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

Related Items

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, 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, 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, An algorithm for calculating the independence and vertex-cover polynomials of a graph, Maximal independent sets on a grid graph