Construction of codes identifying sets of vertices
From MaRDI portal
Publication:1773205
zbMath1060.05091MaRDI QIDQ1773205
Julien Moncel, Sylvain Gravier
Publication date: 25 April 2005
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/124425
Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60) Graph theory (05C99)
Related Items (13)
Optimal identification of sets of edges using 2-factors ⋮ On cages admitting identifying codes ⋮ Partial linear spaces and identifying codes ⋮ The minimum identifying code graphs ⋮ Complexity results for identifying codes in planar graphs ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ Adaptive identification in graphs ⋮ On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) ⋮ Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code ⋮ Upper bounds for binary identifying codes ⋮ Locating-Domination and Identification ⋮ Identifying Codes in Trees and Planar Graphs ⋮ Codes Identifying Vertices in Graphs
This page was built for publication: Construction of codes identifying sets of vertices
