Publication:4474243
From MaRDI portal
zbMath1057.94035MaRDI QIDQ4474243
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2227/22270082.htm
94B65: Bounds on codes
94C12: Fault detection; testing in circuits and networks
94B25: Combinatorial codes
Related Items
Optimal identification of sets of edges using 2-factors, The minimum identifying code graphs, Partial linear spaces and identifying codes, Adaptive identification in graphs, Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code, Characterizing identifying codes from the spectrum of a graph or digraph, On cages admitting identifying codes, Watching systems in graphs: an extension of identifying codes, On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\), Identifying Codes in Trees and Planar Graphs, Liar's domination, Codes Identifying Vertices in Graphs