TY - JOUR
T1 - Identifying and locating-dominating codes on chains and cycles
AU - Bertrand, Nathalie
AU - Charon, Irène
AU - Hudry, Olivier
AU - Lobstein, Antoine
PY - 2004/10/1
Y1 - 2004/10/1
N2 - 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.
AB - 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.
U2 - 10.1016/j.ejc.2003.12.013
DO - 10.1016/j.ejc.2003.12.013
M3 - Article
AN - SCOPUS:4344585685
SN - 0195-6698
VL - 25
SP - 969
EP - 987
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
IS - 7
ER -