Monotonicity of the minimum cardinality of an identifying code in the hypercube
From MaRDI portal
Publication:2492191
DOI10.1016/j.dam.2005.05.030zbMath1093.94033OpenAlexW2028229839MaRDI QIDQ2492191
Publication date: 9 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.030
Related Items
On identifying codes in the Cartesian product of a path and a complete graph, New results on variants of covering codes in Sierpiński graphs, Optimal identifying codes of two families of Cayley 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, r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube, New results of identifying codes in product graphs, Improved bounds on identifying codes in binary Hamming spaces, New identifying codes in the binary Hamming space, On binary linear \(r\)-identifying codes, Locating-Domination and Identification, On the size of identifying codes in binary hypercubes
Cites Work