On a new class of identifying codes in graphs

DOI10.1016/J.IPL.2006.11.007zbMath1185.05053OpenAlexW2046463303MaRDI QIDQ845971

Tero Laihonen, Iiro S. Honkala

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.007

zbMATH Keywords

identificationfault toleranceparallel processingoptimal code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Other types of codes (94B60) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (13)

New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid ⋮ On robust identification in the square and King grids ⋮ On regular and new types of codes for location-domination ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ Optimal identifying codes in the infinite 3-dimensional king grid ⋮ Locating and identifying codes in circulant graphs ⋮ On a conjecture regarding identification in Hamming graphs ⋮ On \(t\)-revealing codes in binary Hamming spaces ⋮ Tolerant location detection in sensor networks ⋮ The solid-metric dimension ⋮ Optimal bounds on codes for location in circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On identifying codes in the hexagonal mesh
• The minimum density of an identifying code in the king lattice.
• Codes for identification in the king lattice
• Fault-tolerant locating-dominating sets
• On identification in the triangular grid
• On the density of identifying codes in the square lattice
• On the identification of sets of points in the square lattice
• 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
• Sequences of optimal identifying codes
• On Identifying Codes in the Triangular and Square Grids
• Two families of optimal identifying codes in binary Hamming spaces
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• 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: On a new class of identifying codes in graphs