An optimal edge-robust identifying code in the triangular lattice
From MaRDI portal
Publication:1890400
DOI10.1007/s00026-004-0222-6zbMath1059.94030OpenAlexW1964074763MaRDI QIDQ1890400
Publication date: 3 January 2005
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-004-0222-6
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25)
Related Items (9)
On identifying codes that are robust against edge changes ⋮ A family of optimal identifying codes in \(\mathbb Z^2\) ⋮ On robust identification in the square and King grids ⋮ Minimum sizes of identifying codes in graphs differing by one vertex ⋮ Tolerant identification with Euclidean balls ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ An optimal locating-dominating set in the infinite triangular grid ⋮ Minimum sizes of identifying codes in graphs differing by one edge ⋮ Optimal open-locating-dominating sets in infinite triangular grids
This page was built for publication: An optimal edge-robust identifying code in the triangular lattice
