A carregar...
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.
Na minha lista:
| Publicado no: | Graphs Comb |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Springer Japan
2019
|
| Assuntos: | |
| Acesso em linha: | 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 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|