scientific article; zbMATH DE number 1436153
From MaRDI portal
Publication:4948746
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S" /><151::AID-JCD8>3.0.CO;2-S 10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-SzbMath1016.94041MaRDI QIDQ4948746
Uri Blass, Simon N. Litsyn, Iiro S. Honkala
Publication date: 6 August 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Optimal codes for strong identification ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ Unnamed Item ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori ⋮ Identifying codes of the direct product of two cliques ⋮ On the identification problems in products of cycles ⋮ The minimum density of an identifying code in the king lattice. ⋮ Identifying codes of corona product graphs ⋮ Links Between Discriminating and Identifying Codes in the Binary Hamming Space ⋮ New bounds on binary identifying codes ⋮ New results of identifying codes in product graphs ⋮ Adaptive identification in graphs ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ New identifying codes in the binary Hamming space ⋮ On identifying codes in binary Hamming spaces ⋮ On binary linear \(r\)-identifying codes ⋮ Monotonicity of the minimum cardinality of an identifying code in the hypercube ⋮ Liar's domination ⋮ Upper bounds for binary identifying codes ⋮ On the size of identifying codes in binary hypercubes ⋮ On the density of identifying codes in the square lattice
Cites Work
This page was built for publication:
