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.
On locating-dominating sets in i nfinite grids
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.