The minimum density of an identifying code in the king lattice.
From MaRDI portal
Publication:1422415
Recommendations
Cites work
- scientific article; zbMATH DE number 1522566 (Why is no real title available?)
- scientific article; zbMATH DE number 1436153 (Why is no real title available?)
- Bounds for codes identifying vertices in the hexagonal grid
- Bounds on identifying codes
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
- New bounds for codes identifying vertices in graphs
- On a new class of codes for identifying vertices in graphs
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On identifying codes
- On the density of identifying codes in the square lattice
Cited in
(30)- Locating-domination and identification
- Minimum density of identifying codes of king grids
- Minimum density of identifying codes of king grids
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Identification in \(\mathbb Z^2\) using Euclidean balls
- On identification in the triangular grid
- On the density of identifying codes in the square lattice
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
- Density of identifying codes of hexagonal grids with finite number of rows
- On Iiro Honkala's contributions to identifying codes
- Adaptive identification in graphs
- Codes for identification in the king lattice
- On robust identification in the square and King grids
- A family of optimal identifying codes in \(\mathbb Z^2\)
- New results on variants of covering codes in Sierpiński graphs
- Identifying codes of corona product graphs
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
- Optimal identifying codes in the infinite 3-dimensional king grid
- Information retrieval and the average number of input clues
- Optimal identifying codes of two families of Cayley graphs
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- On two variations of identifying codes
- On 2-edge robust \(r\)-identifying codes in the king grid
- Identifying and locating-dominating codes on chains and cycles
- On a new class of identifying codes in graphs
- Tolerant identification with Euclidean balls
- Identifying codes and locating-dominating sets on paths and cycles
- Optimal error-detection system for identifying codes
- Paths and cycles identifying vertices in twisted cubes
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)
