2023/07/11 by Eun‐Kyung Cho, Minki Kim, Cho, Eun-Kyung +1
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2307.05119
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.