On the Density of Identifying Codes in t
β
Iiro Honkala; Antoine Lobstein
π
Article
π
2002
π
Elsevier Science
π
English
β 148 KB
Let G=(V, E) be an undirected graph and C a subset of vertices. If the sets B r (v) 5 C, v Β₯ V, are all nonempty and different, where B r (v) denotes the set of all points within distance r from v, we call C an r-identifying code. We give bounds on the best possible density of r-identifying codes in