Hop domination and 2-step domination are NP-complete on d-regular graphs for d at least 3, claw-free graphs, and unit disk graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
Hop domination and 2-step domination are NP-complete on d-regular graphs for d at least 3, claw-free graphs, and unit disk graphs.