Optimal lower bound for 2-identifying code in the hexagonal grid

Ville Junnila, Tero Laihonen

An $r$-identifying code in a graph $G=(V,E)$ is a subset $C\subseteq V$ such that for each $u\in V$ the intersection of $C$ and the ball of radius $r$ centered at $u$ is non-em…