Enumeration of structure-sensitive graphical subsets: Theory

AUTOR(ES)
RESUMO

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.

Documentos Relacionados