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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
-
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.