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.
A note on domination and total dom ination in prisms
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Defines local identifying and locating-dominating codes and establishes asymptotically tight bounds for optimal sizes in binary hypercubes plus optimal densities for seven of eight grid constructions.
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.
-
Optimal local identifying and local locating-dominating codes
Defines local identifying and locating-dominating codes and establishes asymptotically tight bounds for optimal sizes in binary hypercubes plus optimal densities for seven of eight grid constructions.