scientific article; zbMATH DE number 2081125
From MaRDI portal
Publication:4474243
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12) Combinatorial codes (94B25)
Related Items
Optimal identification of sets of edges using 2-factors ⋮ Characterizing identifying codes from the spectrum of a graph or digraph ⋮ On cages admitting identifying codes ⋮ Partial linear spaces and identifying codes ⋮ The minimum identifying code graphs ⋮ Watching systems in graphs: an extension of identifying codes ⋮ Adaptive identification in graphs ⋮ Liar's domination ⋮ 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 ⋮ Identifying Codes in Trees and Planar Graphs ⋮ Codes Identifying Vertices in Graphs
