On Identifying Codes in the Triangular and Square Grids
From MaRDI portal
Publication:4651465
DOI10.1137/S0097539703433110zbMath1060.94053MaRDI QIDQ4651465
Tero Laihonen, Iiro S. Honkala
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539703433110
94B65: Bounds on codes
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
94C12: Fault detection; testing in circuits and networks
Related Items
The identifying code number and Mycielski's construction of graphs, Unnamed Item, Identification in \(\mathbb Z^2\) using Euclidean balls, On a new class of identifying codes in graphs, On robust identification in the square and King grids, New bounds on binary identifying codes, On identifying codes in the hexagonal mesh, Optimal identifying codes of two families of Cayley graphs, New results of identifying codes in product graphs, On identifying codes that are robust against edge changes, New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid, On minimum identifying codes in some Cartesian product graphs, An optimal locating-dominating set in the infinite triangular grid, An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid, Identifying codes of the direct product of two cliques, Identifying codes of corona product graphs, Locating-Domination and Identification
