Bounds on the minimum size of self-identifying codes in K_m × P_n and K_m × C_n are linear in n with m-dependent coefficients and asymptotically tight.
On a new class of codes for identifying vertices in graphs
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative 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.
New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.
citing papers explorer
-
Self-identifying codes in direct products of complete graphs with paths and cycles
Bounds on the minimum size of self-identifying codes in K_m × P_n and K_m × C_n are linear in n with m-dependent coefficients and asymptotically tight.
-
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.
-
Finding codes on infinite grids automatically
New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.