𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Identifying Codes in the Triangular and Square Grids

✍ Scribed by Honkala, Iiro; Laihonen, Tero

Book ID
118181254
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
150 KB
Volume
33
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Density of Identifying Codes in t
On the Density of Identifying Codes in the Square Lattice
✍ 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