On independent domination and packing numbers of subcubic graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929324285755392 |
|---|---|
| author | Bai, Xuqing Gao, Zhipeng Xi, Changqing Yue, Jun |
| author_facet | Bai, Xuqing Gao, Zhipeng Xi, Changqing Yue, Jun |
| contents | In a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of characterizing subcubic graphs that achieve this bound. In this paper, we completely solve the question by proving that exactly four graphs meet this bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_04617 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On independent domination and packing numbers of subcubic graphs Bai, Xuqing Gao, Zhipeng Xi, Changqing Yue, Jun Combinatorics In a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of characterizing subcubic graphs that achieve this bound. In this paper, we completely solve the question by proving that exactly four graphs meet this bound. |
| title | On independent domination and packing numbers of subcubic graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2401.04617 |