Construction of codes identifying sets of vertices
From MaRDI portal
Publication:1773205
zbMATH Open1060.05091MaRDI QIDQ1773205FDOQ1773205
Authors: Sylvain Gravier, Julien Moncel 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Fault detection; testing in circuits and networks (94C12) Graph theory (05C99) Other types of codes (94B60)
Cited In (18)
- Constructing codes identifying sets of vertices
- Codes identifying sets of vertices in random networks
- Locating sensors in paths and cycles: the case of 2-identifying codes
- Bounds on identifying codes
- The minimum identifying code graphs
- Locating-domination and identification
- On Iiro Honkala's contributions to identifying codes
- On cages admitting identifying codes
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
- Optimal identification of sets of edges using 2-factors
- Partial linear spaces and identifying codes
- Identifying codes in trees and planar graphs
- Complexity results for identifying codes in planar graphs
- Adaptive identification in graphs
- Upper bounds for binary identifying codes
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- Vertex identifying codes for the \(n\)-dimensional lattice
- Codes Identifying Vertices in Graphs
This page was built for publication: Construction of codes identifying sets of vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773205)
