On the density of identifying codes in the square lattice

DOI10.1006/jctb.2001.2106zbMath1027.94036OpenAlexW1989117429MaRDI QIDQ1850615

Iiro S. Honkala, Antoine C. Lobstein

Publication date: 10 December 2002

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

Full work available at URL: https://semanticscholar.org/paper/6b848ebfc2e0ed03a185e3eb2aec4671b3b2c8af

zbMATH Keywords

fault detectiondensityundirected graphsquare latticeidentifying code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60) Applications of graph theory to circuits and networks (94C15)

Related Items (13)

On a new class of identifying codes in graphs ⋮ On robust identification in the square and King grids ⋮ Tolerant identification with Euclidean balls ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ Identifying codes and locating-dominating sets on paths and cycles ⋮ The minimum density of an identifying code in the king lattice. ⋮ New lower bound for 2-identifying code in the square grid ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ New bounds on binary identifying codes ⋮ Liar's domination ⋮ Locating-Domination and Identification ⋮ On identification in the triangular grid ⋮ Identifying codes of degree 4 Cayley graphs over abelian groups

Cites Work

• On the covering of vertices for fault diagnosis in hypercubes
• New bounds for codes identifying vertices in graphs
• Bounds for Codes Identifying Vertices in the Hexagonal Grid
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• On a new class of codes for identifying vertices in graphs
• Bounds on identifying codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the density of identifying codes in the square lattice