General bounds for identifying codes in some infinite regular graphs

zbMath0990.05074MaRDI QIDQ5954312

Antoine C. Lobstein, Irène Charon, Olivier Hudry, Iiro S. Honkala

Publication date: 7 February 2002

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121920

zbMATH Keywords

\(r\)-identifying codeinfinite regular graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Bounds on codes (94B65)

Related Items (20)

Optimal codes for strong identification ⋮ On identifying codes that are robust against edge changes ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ On a new class of identifying codes in graphs ⋮ A family of optimal identifying codes in \(\mathbb Z^2\) ⋮ On robust identification in the square and King grids ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori ⋮ An optimal locating-dominating set in the infinite triangular grid ⋮ The minimum density of an identifying code in the king lattice. ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Locating and identifying codes in circulant networks ⋮ New lower bound for 2-identifying code in the square grid ⋮ Adaptive identification in graphs ⋮ Locating-Domination and Identification ⋮ Minimum-Density Identifying Codes in Square Grids ⋮ On identifying codes in the hexagonal mesh ⋮ On identification in the triangular grid ⋮ Identifying codes of degree 4 Cayley graphs over abelian groups

This page was built for publication: General bounds for identifying codes in some infinite regular graphs