scientific article; zbMATH DE number 2081125
From MaRDI portal
Publication:4474243
Recommendations
Cited in
(24)- Identifying codes in trees and planar graphs
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Partial linear spaces and identifying codes
- 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
- Codes Identifying Vertices in Graphs
- Optimal identification of sets of edges using 2-factors
- Edge identifying codes
- On strongly identifying codes
- Vertex identifying codes for fault isolation in communication networks
- Vertex identifying codes for the \(n\)-dimensional lattice
- On cages admitting identifying codes
- Adaptive identification in graphs
- Families of optimal codes for strong identification
- Optimal codes for strong identification
- Characterizing identifying codes from the spectrum of a graph or digraph
- Liar's domination
- On codes identifying sets of vertices in Hamming spaces
- Two families of optimal identifying codes in binary Hamming spaces
- Sequences of optimal identifying codes
- Codes identifying sets of vertices in random networks
- On two variations of identifying codes
- The minimum identifying code graphs
- Watching systems in graphs: an extension of identifying codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474243)
