scientific article; zbMATH DE number 1436153
From MaRDI portal
Publication:4948746
DOI10.1002/(SICI)1520-6610(2000)8:2%3C151::AID-JCD8%3E3.0.CO;2-SzbMATH Open1016.94041MaRDI QIDQ4948746FDOQ4948746
Authors: Uri Blass, Iiro Honkala, Simon Litsyn 
Publication date: 6 August 2003
Title of this publication is not available (Why is that?)
Cites Work
Cited In (27)
- Paths and cycles identifying vertices in twisted cubes
- The minimum density of an identifying code in the king lattice.
- On binary linear \(r\)-identifying codes
- On identifying codes in binary Hamming spaces
- Title not available (Why is that?)
- Liar's domination
- On the identification problems in products of cycles
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
- On the size of identifying codes in binary hypercubes
- Optimal codes for strong identification
- Codes for strong identification
- On Iiro Honkala's contributions to identifying codes
- New bounds on binary identifying codes
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Adaptive identification in graphs
- Identifying codes of the direct product of two cliques
- Identifying codes of corona product graphs
- Optimal identifying codes of two families of Cayley graphs
- Upper bounds for binary identifying codes
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- New results of identifying codes in product graphs
- Code Reverse Engineering Problem for Identification Codes
- On minimum identifying codes in some Cartesian product graphs
- On the density of identifying codes in the square lattice
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
- Identifying codes in vertex-transitive graphs and strongly regular graphs
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 Q4948746)
