The minimum density of an identifying code in the king lattice.
From MaRDI portal
Publication:1422415
DOI10.1016/S0012-365X(03)00306-6zbMath1037.05018OpenAlexW2056540960MaRDI QIDQ1422415
Olivier Hudry, Irène Charon, Antoine C. Lobstein, Iiro S. Honkala
Publication date: 14 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00306-6
Applications of graph theory (05C90) Bounds on codes (94B65) Distance in graphs (05C12) Combinatorial codes (94B25)
Related Items (22)
Identifying and locating-dominating codes on chains and cycles ⋮ 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\) ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ On robust identification in the square and King grids ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ Tolerant identification with Euclidean balls ⋮ 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 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 ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Identifying codes of corona product graphs ⋮ Information retrieval and the average number of input clues ⋮ Adaptive identification in graphs ⋮ On two variations of identifying codes ⋮ Locating-Domination and Identification ⋮ On identification in the triangular grid
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds for codes identifying vertices in graphs
- On the density of identifying codes in the square lattice
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On a new class of codes for identifying vertices in graphs
- Bounds on identifying codes
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
This page was built for publication: The minimum density of an identifying code in the king lattice.
