On identifying codes in the King grid that are robust against edge deletions

zbMath1159.05041MaRDI QIDQ1010708

Tero Laihonen, Iiro S. Honkala

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129770

zbMATH Keywords

optimal codeidentifying codeedge deletionking gridcode robust against edge deletion

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Paths and cycles (05C38) Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

On identifying codes that are robust against edge changes ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code

This page was built for publication: On identifying codes in the King grid that are robust against edge deletions