Independent domination versus packing in subcubic graphs
Eun-Kyung Cho, Minki Kim
TL;DR
This paper proves that in subcubic graphs, the independent domination number is at most three times the packing number, strengthening a previous bound relating domination and packing numbers.
Contribution
The paper establishes a tighter upper bound on the independent domination number in subcubic graphs, improving upon previous results linking domination and packing.
Findings
Independent domination number ≤ 3 × packing number in subcubic graphs
Strengthens previous bounds on domination in relation to packing
Provides theoretical insight into graph domination properties
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Graph Labeling and Dimension Problems