Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice

DOI10.1007/S00373-006-0682-ZzbMath1124.94013OpenAlexW2027213710MaRDI QIDQ882790

Tero Laihonen

Publication date: 24 May 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0682-z

zbMATH Keywords

graphs\(t\)-edge-robust \(r\)-identifying codesking latticeoptimal densities

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial codes (94B25)

Related Items (5)

On identifying codes that are robust against edge changes ⋮ A family of optimal identifying codes in \(\mathbb Z^2\) ⋮ Minimum sizes of identifying codes in graphs differing by one vertex ⋮ Minimum sizes of identifying codes in graphs differing by one edge ⋮ Locating-Domination and Identification

Cites Work

• On a new class of identifying codes in graphs
• The minimum density of an identifying code in the king lattice.
• On the identification of sets of points in the square lattice
• An optimal edge-robust identifying code in the triangular lattice
• Bounds for Codes Identifying Vertices in the Hexagonal Grid
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• On robust and dynamic identifying codes
• On a new class of codes for identifying vertices in graphs
• Sequences of optimal identifying codes
• Bounds on identifying codes
• General bounds for identifying codes in some infinite regular graphs
• Identifying codes with small radius in some infinite regular graphs

This page was built for publication: Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice