Enumeration of structure-sensitive graphical subsets: Theory
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.
Guardat en:
| Publicat a: | Proc Natl Acad Sci U S A |
|---|---|
| Autors principals: | , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
National Academy of Sciences
1981
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC319866/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/16592974/ https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.78.2.692 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|