Carregant...
Disjoint Paired-Dominating sets in Cubic Graphs
A paired-dominating set of a graph G is a dominating set D with the additional requirement that the induced subgraph G[D] contains a perfect matching. We prove that the vertex set of every claw-free cubic graph can be partitioned into two paired-dominating sets.
Guardat en:
| Publicat a: | Graphs Comb |
|---|---|
| Autors principals: | , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Springer Japan
2019
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6777509/ https://ncbi.nlm.nih.gov/pubmed/31631942 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00373-019-02063-w |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|