Consider a connected undirected graph $G=(V,E)$ and a subset of vertices C. If for all vertices v ∈ V, the sets Bᵣ(v) ∩ C are all nonempty and pairwise distinct, where Bᵣ(v) denotes the set of all points within distance r from v, then we call C an r-identifying code. We give general lower and upper bounds on the best possible density of r-identifying codes in three infinite regular graphs.
No takes yet. Share an insight, caveat, or question.
Charon et al. (2001) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: