Minimum-density identifying codes in square grids - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2016

Minimum-density identifying codes in square grids

Marwane Bouznif
  • Function : Author
  • PersonId : 925654
Myriam Preissmann


An identifying code in a graph $G$ is a subset of vertices with the property that for each vertex $v \in V(G)$, the collection of elements of $C$ at distance at most $1$ from $v$ is non-empty and distinct from the collection of any other vertex. We consider the minimum density $d^*({\cal S}_k)$ of an identifying code in the square grid ${\cal S}_k$ of height $k$ (i.e. with vertex set $ \mathbb{Z} \times \{1, \dots , k\}$). Using the Discharging Method, we prove $\displaystyle \frac{7}{20} + \frac{1}{20k} \leq d^*({\cal S}_k) \leq \min \left\{\frac{2}{5}, \frac{7}{20} + \frac{3}{10k} \right\}$, and $\displaystyle d^*({\cal S}_3) =\frac{3}{7}$.
Fichier principal
Vignette du fichier
RR-8845.pdf (743.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01259550 , version 1 (20-01-2016)


  • HAL Id : hal-01259550 , version 1


Marwane Bouznif, Frédéric Havet, Myriam Preissmann. Minimum-density identifying codes in square grids. [Research Report] RR-8845, INRIA Sophia Antipolis - I3S. 2016. ⟨hal-01259550⟩
187 View
134 Download


Gmail Facebook Twitter LinkedIn More