Proves that k-limited domination is NP-complete for fixed k >= 2 and derives sharp bounds and exact values for the parameter on Cartesian products.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
Relates signed total Roman domination number on cubic graphs to open packing, 2-tuple total domination, and signed total domination numbers to derive bounds and NP-completeness; shows domatic number determined by degree-3 vertices; computes exact values on complete multipartite graphs.
citing papers explorer
-
On $k$-limited domination: complexity and Cartesian products
Proves that k-limited domination is NP-complete for fixed k >= 2 and derives sharp bounds and exact values for the parameter on Cartesian products.
-
The Normal Domination Partizan Game in Stars
The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
-
Signed Total Roman Domination and Domatic Numbers: Degree Three and Complete Multipartite Graphs
Relates signed total Roman domination number on cubic graphs to open packing, 2-tuple total domination, and signed total domination numbers to derive bounds and NP-completeness; shows domatic number determined by degree-3 vertices; computes exact values on complete multipartite graphs.