載入...
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:
| 發表在: | Graphs Comb |
|---|---|
| Main Authors: | , , , |
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Springer Japan
2019
|
| 主題: | |
| 在線閱讀: | 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 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|