Title
On Identifying Codes in the Triangular and Square Grids
Abstract
It is shown that in the infinite square grid the density of every $(r, \leq 2)$-identifying code is at least 1/8 and that there exists a sequence $C_r$ of $(r, \leq 2)$-identifying codes such that the density of Cr tends to 1/8 when $r \rightarrow \infty$. In the infinite triangular grid a sequence $C'_r$ of $(r, \leq 2)$-identifying codes is given such that the density of $C'_r$ tends to 0 when $r \rightarrow \infty$.
Year
DOI
Venue
2004
10.1137/S0097539703433110
SIAM J. Comput.
Keywords
Field
DocType
triangular lattice,density
Hexagonal lattice,Discrete mathematics,Combinatorics,Square lattice,Square tiling,Triangular grid,Mathematics
Journal
Volume
Issue
ISSN
33
2
0097-5397
Citations 
PageRank 
References 
16
0.97
12
Authors
2
Name
Order
Citations
PageRank
Iiro S. Honkala137540.72
Tero Laihonen236339.39