Independent domination versus packing in subcubic graphs
Combinatorics
2023-07-12 v1
Abstract
In 2011, Henning, L\"{o}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.
Cite
@article{arxiv.2307.05119,
title = {Independent domination versus packing in subcubic graphs},
author = {Eun-Kyung Cho and Minki Kim},
journal= {arXiv preprint arXiv:2307.05119},
year = {2023}
}
Comments
9 pages, 3 figures