𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Identifying codes in some subgraphs of the square lattice

✍ Scribed by Marc Daniel; Sylvain Gravier; Julien Moncel

Book ID
108280927
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
374 KB
Volume
319
Category
Article
ISSN
0304-3975

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

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