Identifying codes with small radius in some infinite regular graphs
From MaRDI portal
Publication:5960786
zbMath0985.05033MaRDI QIDQ5960786
Irène Charon, Olivier Hudry, Antoine C. Lobstein
Publication date: 25 April 2002
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121793
Graph theory (including graph drawing) in computer science (68R10) Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (34)
Identifying and locating-dominating codes on chains and cycles ⋮ On identifying codes that are robust against edge changes ⋮ Watching systems in the King grid ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ On a new class of identifying codes in graphs ⋮ New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid ⋮ A family of optimal identifying codes in \(\mathbb Z^2\) ⋮ On robust identification in the square and King grids ⋮ Extremal cardinalities for identifying and locating-dominating codes in graphs ⋮ Identifying codes in some subgraphs of the square lattice ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori ⋮ An optimal locating-dominating set in the infinite triangular grid ⋮ An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid ⋮ Identifying codes and locating-dominating sets on paths and cycles ⋮ Optimal identifying codes in the infinite 3-dimensional king grid ⋮ On the identification problems in products of cycles ⋮ 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 ⋮ Locating and identifying codes in circulant graphs ⋮ Adaptive identification in graphs ⋮ New identifying codes in the binary Hamming space ⋮ A linear algorithm for minimum 1-identifying codes in oriented trees ⋮ Minimum density of identifying codes of king grids ⋮ Minimum density of identifying codes of king grids ⋮ Locating-Domination and Identification ⋮ On \(r\)-locating-dominating sets in paths ⋮ Optimal bounds on codes for location in circulant graphs ⋮ On identifying codes in the hexagonal mesh ⋮ On identification in the triangular grid ⋮ Identifying codes of degree 4 Cayley graphs over abelian groups ⋮ On the Structure of Identifiable Graphs
This page was built for publication: Identifying codes with small radius in some infinite regular graphs
