𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum identifying code graphs

✍ Scribed by André Raspaud; Li-Da Tong

Book ID
113564781
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
220 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Identifying Codes in Line Graphs
Identifying Codes in Line Graphs
✍ Florent Foucaud; Sylvain Gravier; Reza Naserasr; Aline Parreau; Petru Valicov 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 811 KB
The minimum density of an identifying co
The minimum density of an identifying code in the king lattice
✍ Irène Charon; Iiro Honkala; Olivier Hudry; Antoine Lobstein 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Consider a connected undirected graph G =(V; E) and a subset of vertices C. If for all vertices v ∈ V , the sets Br(v) ∩ C are all nonempty and di erent, where Br(v) denotes the set of all points within distance r from v, then we call C an r-identifying code. For all r, we give the exact value of th