New bounds for codes identifying vertices in graphs

MaRDI QIDQ1283874zbMATH OpenFDO

Authors Iiro Honkala, Gilles Zémor, Gérard Cohen, Antoine Lobstein

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, http://www.emis.de/journals/EJC/Volume_6/v6i1toc.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

codeinfinite graph

Mathematics Subject Classification ID

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)

Recommendations

• Bounds for codes identifying vertices in the hexagonal grid
• Lower bounds for identifying codes in some infinite grids
• On the density of identifying codes in the square lattice
• Minimum-Density Identifying Codes in Square Grids
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid

Cited in

(32)

• On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
• Minimum density of identifying codes of king grids
• Minimum density of identifying codes of king grids
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• Locating sensors in paths and cycles: the case of 2-identifying codes
• On the identification of vertices using cycles
• On identification in the triangular grid
• Open neighborhood locating-dominating in trees
• On the density of identifying codes in the square lattice
• Sphere coverings and identifying codes
• General bounds for identifying codes in some infinite regular graphs
• On graphs having a \(V\setminus \{x\}\) set as an identifying code
• Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes
• On strongly identifying codes
• Vertex identifying codes for the \(n\)-dimensional lattice
• Locating and identifying codes in circulant networks
• On robust identification in the square and King grids
• Identifying codes in some subgraphs of the square lattice
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Minimum-Density Identifying Codes in Square Grids
• Bounds on codes derived by counting components in Varshamov graphs
• Periodicity of identifying codes in strips
• Liar's domination
• Identifying codes in the complementary prism of cycles
• Neighborhood distinguishing coloring in graphs
• The minimum density of an identifying code in the king lattice.
• An unexpected result in coding the vertices of a graph
• Identifying codes for infinite triangular grids with a finite number of rows
• On a new class of identifying codes in graphs
• Bounds for codes identifying vertices in the hexagonal grid
• Identifying codes for generalized quadrangles
• Complexity results for identifying codes in planar graphs

This page was built for publication: New bounds for codes identifying vertices in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283874)