Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
From MaRDI portal
Publication:2444553
DOI10.1016/j.dam.2013.04.027zbMath1285.05143OpenAlexW1970895380MaRDI QIDQ2444553
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.027
Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)
Related Items (4)
The metric dimension for resolving several objects ⋮ Spy game: FPT-algorithm, hardness and graph products ⋮ Spy game: FPT-algorithm and results on graph products ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
Cites Work
- On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
- Adaptive identification in Torii in the King lattice
- On locating--dominating sets in infinite grids
- The minimum density of an identifying code in the king lattice.
- Codes for identification in the king lattice
- Watching systems in the King grid
- 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
- Watching systems in graphs: an extension of identifying codes
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
