On independent domination and packing numbers of subcubic graphs
Combinatorics
2024-04-24 v3
Abstract
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.
Keywords
Cite
@article{arxiv.2401.04617,
title = {On independent domination and packing numbers of subcubic graphs},
author = {Xuqing Bai and Zhipeng Gao and Changqing Xi and Jun Yue},
journal= {arXiv preprint arXiv:2401.04617},
year = {2024}
}