Geodesic
General bounds for identifying codes in some infinite regular graphs
The electronic journal of combinatorics, Tome 8 (2001) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Consider a connected undirected graph $G=(V,E)$ and a subset of vertices $C$. If for all vertices $v \in V$, the sets $B_r(v) \cap C$ are all nonempty and pairwise distinct, where $B_r(v)$ denotes the set of all points within distance $r$ from $v$, then we call $C$ an $r$-identifying code. We give general lower and upper bounds on the best possible density of $r$-identifying codes in three infinite regular graphs.
DOI : 10.37236/1583
Classification : 05C35, 94B65, 68R10
Mots-clés : \(r\)-identifying code, infinite regular graphs 
@article{10_37236_1583,
     author = {Ir\`ene Charon and Iiro Honkala and Olivier Hudry and Antoine Lobstein},
     title = {General bounds for identifying codes in some infinite regular graphs},
     journal = {The electronic journal of combinatorics},
     year = {2001},
     volume = {8},
     number = {1},
     doi = {10.37236/1583},
     zbl = {0990.05074},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1583/}
}
TY  - JOUR
AU  - Irène Charon
AU  - Iiro Honkala
AU  - Olivier Hudry
AU  - Antoine Lobstein
TI  - General bounds for identifying codes in some infinite regular graphs
JO  - The electronic journal of combinatorics
PY  - 2001
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1583/
DO  - 10.37236/1583
ID  - 10_37236_1583
ER  - 
%0 Journal Article
%A Irène Charon
%A Iiro Honkala
%A Olivier Hudry
%A Antoine Lobstein
%T General bounds for identifying codes in some infinite regular graphs
%J The electronic journal of combinatorics
%D 2001
%V 8
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1583/
%R 10.37236/1583
%F 10_37236_1583
Irène Charon; Iiro Honkala; Olivier Hudry; Antoine Lobstein. General bounds for identifying codes in some infinite regular graphs. The electronic journal of combinatorics, Tome 8 (2001) no. 1. doi: 10.37236/1583

Cité par Sources :