Bounds for Codes Identifying Vertices in the Hexagonal Grid
From MaRDI portal
Publication:2706181
DOI10.1137/S0895480199360990zbMath0961.05036MaRDI QIDQ2706181
Gilles Zémor, Antoine C. Lobstein, Iiro S. Honkala, Gérard D. Cohen
Publication date: 19 March 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Bounds on codes (94B65)
Related Items (23)
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 ⋮ On robust identification in the square and King grids ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ 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 ⋮ The minimum density of an identifying code in the king lattice. ⋮ New bounds on the minimum density of an identifying code for the infinite hexagonal grid ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ Identifying codes for infinite triangular grids with a finite number of rows ⋮ Minimum density of identifying codes of king grids ⋮ Liar's domination ⋮ Minimum density of identifying codes of king grids ⋮ Locating-Domination and Identification ⋮ On identifying codes in the hexagonal mesh ⋮ On identification in the triangular grid ⋮ Open-independent, open-locating-dominating sets ⋮ On the density of identifying codes in the square lattice ⋮ Optimal open-locating-dominating sets in infinite triangular grids
This page was built for publication: Bounds for Codes Identifying Vertices in the Hexagonal Grid
