On the covering of vertices for fault diagnosis in hypercubes
Information Processing Letters
On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals
IEEE Transactions on Computers
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 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
Locating sensors in paths and cycles: The case of 2-identifying codes
European Journal of Combinatorics
New bounds on binary identifying codes
Discrete Applied Mathematics
Identification in Z2 using Euclidean balls
Discrete Applied Mathematics
Identifying codes and locating-dominating sets on paths and cycles
Discrete Applied Mathematics
Improved Bounds for $r$-Identifying Codes of the Hex Grid
SIAM Journal on Discrete Mathematics
New lower bound for 2-identifying code in the square grid
Discrete Applied Mathematics
| Hi-index | 0.00 |
Let G = (V, E) be an undirected graph and C a subset of vertices. If the sets Br(υ) ∩ C, υ ∈ V, are all nonempty and different, where Br(υ) denotes the set of all points within distance r from υ, we call C an r-identifying code. We give bounds on the best possible density of r-identifying codes in the two-dimensional square lattice.