On codes identifying vertices in the two-dimensional square lattice with diagonals

DOI10.1109/12.908992zbMath1312.68157OpenAlexW2145385305MaRDI QIDQ3417009

Gilles Zémor, Antoine C. Lobstein, Gérard D. Cohen, Iiro S. Honkala

Publication date: 9 January 2007

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/33f17b9c65c17edbf06b371107e11eb581d8cf0a

zbMATH Keywords

identifying code

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (22)

On identifying codes that are robust against edge changes ⋮ Watching systems in the King grid ⋮ 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 ⋮ On robust identification in the square and King grids ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ 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 ⋮ The minimum density of an identifying code in the king lattice. ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ Locating and identifying codes in circulant graphs ⋮ Information retrieval and the average number of input clues ⋮ Liar's domination ⋮ Minimum density of identifying codes of king grids ⋮ Locating-Domination and Identification ⋮ Optimal bounds on codes for location in circulant graphs ⋮ On identification in the triangular grid ⋮ On the density of identifying codes in the square lattice

This page was built for publication: On codes identifying vertices in the two-dimensional square lattice with diagonals