On the covering of vertices for fault diagnosis in hypercubes
Information Processing Letters
Bounds for Codes Identifying Vertices in the Hexagonal Grid
SIAM Journal on Discrete Mathematics
Discrete Mathematics
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
On Codes Identifying Sets of Vertices in Hamming Spaces
Designs, Codes and Cryptography
On the density of identifying codes in the square lattice
Journal of Combinatorial Theory Series B
On the Identification of Vertices and Edges Using Cycles
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
Discrete Applied Mathematics
On identification in the triangular grid
Journal of Combinatorial Theory Series B
On a new class of identifying codes in graphs
Information Processing Letters
On robust identification in the square and king grids
Discrete Applied Mathematics
On identifying codes that are robust against edge changes
Information and Computation
Locating sensors in paths and cycles: The case of 2-identifying codes
European Journal of Combinatorics
Identifying codes and locating-dominating sets on paths and cycles
Discrete Applied Mathematics
Optimal (r,≤3) -locating-dominating codes in the infinite king grid
Discrete Applied Mathematics
Optimal identifying codes in the infinite 3-dimensional king grid
European Journal of Combinatorics
| Hi-index | 14.98 |
Fault diagnosis of multiprocessor systems motivates the following graph-theoretic definition. A subset $C$ of points in an undirected graph $G=(V,E)$ is called an identifying code if the sets $B(v) \cap C$ consisting of all elements of $C$ within distance one from the vertex $v$ are different. We also require that the sets $B(v) \cap C$ are all nonempty. We take $G$ to be the infinite square lattice with diagonals and show that the density of the smallest identifying code is at least 2/9 and at most 4/17.