New bounds for codes identifying vertices in graphs
From MaRDI portal
Publication:1283874
zbMath0917.05058MaRDI QIDQ1283874
Gilles Zémor, Iiro S. Honkala, Antoine C. Lobstein, Gérard D. Cohen
Publication date: 31 March 1999
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119827
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fault detection; testing in circuits and networks (94C12) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (15)
Identifying codes in the complementary prism of cycles ⋮ On robust identification in the square and King grids ⋮ Identifying codes in some subgraphs of the square lattice ⋮ Open neighborhood locating-dominating in trees ⋮ Periodicity of identifying codes in strips ⋮ The minimum density of an identifying code in the king lattice. ⋮ Locating and identifying codes in circulant networks ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ Identifying codes for infinite triangular grids with a finite number of rows ⋮ Minimum density of identifying codes of king grids ⋮ Liar's domination ⋮ Minimum density of identifying codes of king grids ⋮ Minimum-Density Identifying Codes in Square Grids ⋮ On identification in the triangular grid ⋮ On the density of identifying codes in the square lattice
This page was built for publication: New bounds for codes identifying vertices in graphs
