Independent domination versus packing in subcubic graphs
arXiv:2307.05119
Abstract
In 2011, Henning, Löwenstein, and Rautenbach observed that the domination number of a graph is bounded from above by the product of the packing number and the maximum degree of the graph. We prove a stronger statement in subcubic graphs: the independent domination number is bounded from above by three times the packing number.
9 pages, 3 figures