Monotonicity of the minimum cardinality of an identifying code in the hypercube
From MaRDI portal
(Redirected from Publication:2492191)
Recommendations
Cites work
Cited in
(14)- On the size of identifying codes in binary hypercubes
- Optimal identifying codes of two families of Cayley graphs
- New results of identifying codes in product graphs
- New results on variants of covering codes in Sierpiński graphs
- On minimum identifying codes in some Cartesian product graphs
- Identifying codes of the direct product of two cliques
- Identifying codes of corona product graphs
- On identifying codes in the Cartesian product of a path and a complete graph
- Locating-domination and identification
- \(r\)-identifying codes in binary Hamming space, \(q\)-ary Lee space and incomplete hypercube
- On binary linear \(r\)-identifying codes
- On Iiro Honkala's contributions to identifying codes
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
This page was built for publication: Monotonicity of the minimum cardinality of an identifying code in the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492191)