Construction of codes identifying sets of vertices

MaRDI QIDQ1773205zbMATH OpenFDO

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, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1r13.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

identifying codes

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Graph theory (05C99) Other types of codes (94B60)

Recommendations

• Constructing codes identifying sets of vertices
• On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
• Extremal graphs for the identifying code problem
• The minimum identifying code graphs
• Publication:4502621

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 cages admitting identifying codes
• On Iiro Honkala's contributions to identifying codes
• Optimal identification of sets of edges using 2-factors
• Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
• 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)