Skip to main content
NCBI home page
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 1981 Mar;78(3):1329–1332. doi: 10.1073/pnas.78.3.1329

Enumeration of structure-sensitive graphical subsets: Calculations

R E Marrifield 1, H E Simmons 1
PMCID: PMC319123  PMID: 16592991

Abstract

Numerical calculations are presented, for all connected graphs on six and fewer vertices, of the numbers of independent sets, connected sets, point and line covers, externally stable sets, kernels, and irredundant sets. With the exception of the number of kernels, the numbers of such sets are all highly structure-sensitive quantities.

Keywords: graph theory, combinatorics

Full text

PDF
1329

Selected References

These references are in PubMed. This may not be the complete list of references from this article.

  1. Merrifield R. E., Simmons H. E. Enumeration of structure-sensitive graphical subsets: Theory. Proc Natl Acad Sci U S A. 1981 Feb;78(2):692–695. doi: 10.1073/pnas.78.2.692. [DOI] [PMC free article] [PubMed] [Google Scholar]

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES