Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
Theoretical Computer Science
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
A linear algorithm for minimum 1-identifying codes in oriented trees
Discrete Applied Mathematics
European Journal of Combinatorics
On locating-dominating sets in infinite grids
European Journal of Combinatorics
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 of cycles with odd orders
European Journal of Combinatorics
On r-locating-dominating sets in paths
European Journal of Combinatorics
A linear algorithm for minimum 1-identifying codes in oriented trees
Discrete Applied Mathematics
Identification in Z2 using Euclidean balls
Discrete Applied Mathematics
Partial linear spaces and identifying codes
European Journal of Combinatorics
Extremal graphs for the identifying code problem
European Journal of Combinatorics
Identifying codes and locating-dominating sets on paths and cycles
Discrete Applied Mathematics
On the size of identifying codes in triangle-free graphs
Discrete Applied Mathematics
Minimum sizes of identifying codes in graphs differing by one vertex
Cryptography and Communications
Watching systems in graphs: An extension of identifying codes
Discrete Applied Mathematics
Locating and identifying codes in circulant networks
Discrete Applied Mathematics
New results on variants of covering codes in Sierpiński graphs
Designs, Codes and Cryptography
Optimal identifying codes in the infinite 3-dimensional king grid
European Journal of Combinatorics
Identifying codes of the direct product of two cliques
European Journal of Combinatorics
Minimum sizes of identifying codes in graphs differing by one edge
Cryptography and Communications
| Hi-index | 0.00 |
Consider a connected undirected graph G = (V, E), a subset of vertices C ⊆ V, and an integer r ≥ 1; for any vertex v ∈ V, let Br(v) denote the ball of radius r centered at v, i.e., the set of all vertices within distance r from v. If for all vertices v ∈ V (respectively, v ∈ V\C), the sets Br(v) ∩ C are all nonempty and different, then we call C an r-identifying code (respectively, an r-locating-dominating code). We study the smallest cardinalities or densities of these codes in chains (finite or infinite) and cycles.