Independent domination versus packing in subcubic graphs

Abstract

In 2011, Henning, Louml;wenstein, and Rautenbach observed that the domination number of a graph is bounded above by the product of the packing number and the maximum degree of the graph. In this paper, we prove a stronger statement in subcubic graphs: The independent domination number is at most three times the packing number.