The minimum density of an identifying code in the king lattice.
From MaRDI portal
Publication:1422415
DOI10.1016/S0012-365X(03)00306-6zbMATH Open1037.05018OpenAlexW2056540960MaRDI QIDQ1422415FDOQ1422415
Authors: Irène Charon, Olivier Hudry, Iiro Honkala, Antoine Lobstein 
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
Recommendations
Applications of graph theory (05C90) Distance in graphs (05C12) Combinatorial codes (94B25) Bounds on codes (94B65)
Cites Work
- On identifying codes
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- Bounds for codes identifying vertices in the hexagonal grid
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- New bounds for codes identifying vertices in graphs
- Title not available (Why is that?)
- Bounds on identifying codes
- Identifying codes with small radius in some infinite regular graphs
- On the density of identifying codes in the square lattice
- General bounds for identifying codes in some infinite regular graphs
Cited In (30)
- Paths and cycles identifying vertices in twisted cubes
- New results on variants of covering codes in Sierpiński graphs
- A family of optimal identifying codes in \(\mathbb Z^2\)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- Identifying codes and locating-dominating sets on paths and cycles
- On robust identification in the square and King grids
- On two variations of identifying codes
- Locating-domination and identification
- Minimum density of identifying codes of king grids
- Minimum density of identifying codes of king grids
- On identification in the triangular grid
- On 2-edge robust \(r\)-identifying codes in the king grid
- On a new class of identifying codes in graphs
- On Iiro Honkala's contributions to identifying codes
- Identifying and locating-dominating codes on chains and cycles
- Optimal identifying codes in the infinite 3-dimensional king grid
- Identification in \(\mathbb Z^2\) using Euclidean balls
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Adaptive identification in graphs
- Identifying codes of corona product graphs
- Optimal identifying codes of two families of Cayley graphs
- Tolerant identification with Euclidean balls
- Codes for identification in the king lattice
- Optimal error-detection system for identifying codes
- On the density of identifying codes in the square lattice
- Information retrieval and the average number of input clues
- Density of identifying codes of hexagonal grids with finite number of rows
This page was built for publication: The minimum density of an identifying code in the king lattice.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422415)
