Open AccessEnumeration of structure-sensitive graphical subsets: Calculations
Author(s) -
R. E. Marrifield,
Howard E. Simmons
Publication year - 1981
Publication title -
proceedings of the national academy of sciences of the united states of america
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 5.011
H-Index - 771
eISSN - 1091-6490
pISSN - 0027-8424
DOI - 10.1073/pnas.78.3.1329
Subject(s) - enumeration , combinatorics , set (abstract data type) , point (geometry) , mathematics , line (geometry) , discrete mathematics , computer science , geometry , programming language
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.