On identification in the triangular grid

DOI10.1016/J.JCTB.2003.10.002MaRDI QIDQ1826954zbMATH OpenOpenAlexFDO

Authors Tero Laihonen, Iiro Honkala

Publication date 6 August 2004

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2003.10.002

zbMATH Keywords

GraphDensityIdentifying codeTriangular latticeTriangular grid

Mathematics Subject Classification ID

Distance in graphs (05C12) Fault detection; testing in circuits and networks (94C12)

Recommendations

• An optimal strongly identifying code in the infinite triangular grid
• On Identifying Codes in the Triangular and Square Grids
• Identifying codes for infinite triangular grids with a finite number of rows
• Bounds for codes identifying vertices in the hexagonal grid
• An optimal edge-robust identifying code in the triangular lattice

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Bounds for codes identifying vertices in the hexagonal grid
• Codes for identification in the king lattice
• Fault-tolerant locating-dominating sets
• General bounds for identifying codes in some infinite regular graphs
• Identifying and locating-dominating codes: NP-completeness results for directed graphs
• Identifying codes with small radius in some infinite regular graphs
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• New bounds for codes identifying vertices in graphs
• On a new class of codes for identifying vertices in graphs
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• On identifying codes
• On identifying codes in binary Hamming spaces
• On the complexity of the identification problem in Hamming spaces
• On the density of identifying codes in the square lattice
• On the identification of sets of points in the square lattice
• The minimum density of an identifying code in the king lattice.

Cited in

(11)

• Liar's domination
• On robust identification in the square and King grids
• On Identifying Codes in the Triangular and Square Grids
• On a new class of identifying codes in graphs
• An optimal edge-robust identifying code in the triangular lattice
• Recognition of triangles by covariogram
• An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
• Adaptive identification in graphs
• Optimal error-detection system for identifying codes
• Density of identifying codes of hexagonal grids with finite number of rows
• Identifying codes for infinite triangular grids with a finite number of rows

This page was built for publication: On identification in the triangular grid

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