Enumeration of structure-sensitive graphical subsets: Theory

R E Merrifield; H E Simmons

doi:10.1073/pnas.78.2.692

. 1981 Feb;78(2):692–695. doi: 10.1073/pnas.78.2.692

Enumeration of structure-sensitive graphical subsets: Theory

R E Merrifield ¹, H E Simmons ¹

PMCID: PMC319866 PMID: 16592974

Abstract

The necessary mathematical machinery is developed for enumeration of the following types of special subsets of the vertices or edges of a general graph: (i) independent sets, (ii) connected sets, (iii) point and line covers, (iv) externally stable sets, (v) kernels, and (vi) irredundant sets.

Keywords: graph theory, combinatorics