Answers are grounded in this paper and cite their sources.
In an undirected graph G=(V,E), a subset C ⊆ V is called an identifying code if the sets B₁(v) ∩ C consisting of all elements of C within distance one from the vertex v are nonempty and different. We take G to be the infinite hexagonal grid and show that the density of any identifying code is at least 16/39 and that there is an identifying code of density 3/7.
No takes yet. Share an insight, caveat, or question.
Cohen et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: