Codes identifying sets of vertices
From MaRDI portal
Recommendations
Cited in
(26)- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Optimal codes for strong identification
- Families of optimal codes for strong identification
- On strongly identifying codes
- Sufficient conditions for a digraph to admit a (1, )-identifying code
- On two variations of identifying codes
- 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
- Edge identifying codes
- Vertex identifying codes for the n-dimensional lattice
- Liar's domination
- Codes Identifying Vertices in Graphs
- Vertex identifying codes for fault isolation in communication networks
- Optimal identification of sets of edges using 2-factors
- The minimum identifying code graphs
- Sequences of optimal identifying codes
- Two families of optimal identifying codes in binary Hamming spaces
- On codes identifying sets of vertices in Hamming spaces
- Partial linear spaces and identifying codes
- On the density of (1, )-locating-dominating codes in the infinite square grid
- On (1, l)-locating-dominating codes in infinite triangular grid
- Codes identifying sets of vertices in random networks
- Adaptive identification in graphs
This page was built for publication: Codes identifying sets of vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474243)
