Geodesic
Lower bounds for identifying codes in some infinite grids
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

An $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and unique. On a finite graph, the density of a code is $|C|/|V(G)|$, which naturally extends to a definition of density in certain infinite graphs which are locally finite. We present new lower bounds for densities of codes for some small values of $r$ in both the square and hexagonal grids.
DOI : 10.37236/394
Classification : 05C70, 68R10, 94B65 
@article{10_37236_394,
     author = {Ryan Martin and Brendon Stanton},
     title = {Lower bounds for identifying codes in some infinite grids},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/394},
     zbl = {1272.05161},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/394/}
}
TY  - JOUR
AU  - Ryan Martin
AU  - Brendon Stanton
TI  - Lower bounds for identifying codes in some infinite grids
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/394/
DO  - 10.37236/394
ID  - 10_37236_394
ER  - 
%0 Journal Article
%A Ryan Martin
%A Brendon Stanton
%T Lower bounds for identifying codes in some infinite grids
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/394/
%R 10.37236/394
%F 10_37236_394
Ryan Martin; Brendon Stanton. Lower bounds for identifying codes in some infinite grids. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/394

Cité par Sources :