New Bounds on the Minimum Density of a Vertex Identifying Code for the Infinite Hexagonal Grid

Ari Cukierman, Gexin Yu

For a graph, $G$, and a vertex $v\in V(G)$, let $N[v]$ be the set of vertices adjacent to and including $v$. A set $D\subseteq V(G)$ is a vertex identifying code if for any two d…