On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
From MaRDI portal
Publication:414945
DOI10.3934/amc.2012.6.27zbMath1241.05111OpenAlexW2070024556MaRDI QIDQ414945
Publication date: 11 May 2012
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2012.6.27
Combinatorics in computer science (68R05) 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 (5)
On the ensemble of optimal identifying codes in a twin-free graph ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Identifying codes of corona product graphs ⋮ On the number of optimal identifying codes in a twin-free graph ⋮ Locating and identifying codes in dihedral graphs
This page was built for publication: On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
