New bounds for codes identifying vertices in graphs

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

zbMATH Keywords

infinite graph; code

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

94C12: Fault detection; testing in circuits and networks

94B99: Theory of error-correcting codes and error-detecting codes

Related Items

Minimum density of identifying codes of king grids, Minimum density of identifying codes of king grids, Identifying codes for infinite triangular grids with a finite number of rows, Identifying codes in some subgraphs of the square lattice, Open neighborhood locating-dominating in trees, On robust identification in the square and King grids, The minimum density of an identifying code in the king lattice., Periodicity of identifying codes in strips, On identification in the triangular grid, On the density of identifying codes in the square lattice, Identifying codes in the complementary prism of cycles, Locating and identifying codes in circulant networks, Locating sensors in paths and cycles: the case of 2-identifying codes, Minimum-Density Identifying Codes in Square Grids, Liar's domination