Assume that G = (V ,E) is an undirected graph, and C ⊆ V . For every v ∈ V , denote Ir(G; v) = {u ∈ C : d(u, v) ≤ r}, where d(u, v) denotes the number of edges on any shortest path from u to v in G. If all the sets Ir(G; v) for v ∈ V are pairwise different, and none of them is the empty set, the codeC is called r-identifying. Themotivation for identifying codes comes, for instance, from finding...