On Identifying Codes in the Triangular and Square Grids

DOI10.1137/S0097539703433110MaRDI QIDQ4651465zbMATH OpenOpenAlexFDO

Authors Tero Laihonen, Iiro 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

zbMATH Keywords

densityidentifying codemultiprocessor systemsquare latticetriangular lattice

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Lower bounds for identifying codes in some infinite grids
• Identifying codes for infinite triangular grids with a finite number of rows
• On identification in the triangular grid
• An optimal strongly identifying code in the infinite triangular grid
• Minimum-Density Identifying Codes in Square Grids

Cited in

(29)

• On identifying codes in the hexagonal mesh
• On identification in the triangular grid
• 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
• The number of completely different optimal identifying codes in the infinite square grid
• 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
• Minimum-Density Identifying Codes in Square Grids
• Locating-domination and identification
• The identifying code number and Mycielski's construction of graphs
• Identifying codes for infinite triangular grids with a finite number of rows
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• scientific article; zbMATH DE number 7655282 (Why is no real title available?)
• Identification in \(\mathbb Z^2\) using Euclidean balls
• Density of identifying codes of hexagonal grids with finite number of rows
• On Iiro Honkala's contributions to identifying codes
• Domination number and identifying code number of the subdivision graphs
• Identifying code number of some of the middle graphs
• On the density of (1, )-locating-dominating codes in the infinite square grid
• On a class of graphs with equal identifying code number and independence number
• On a new class of identifying codes in graphs
• On robust identification in the square and King grids
• New bounds on binary identifying codes
• An optimal strongly identifying code in the infinite triangular grid

This page was built for publication: On Identifying Codes in the Triangular and Square Grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651465)