On the size of identifying codes in binary hypercubes
From MaRDI portal
Publication:1024996
DOI10.1016/j.jcta.2009.02.004zbMath1173.94009arXiv0804.3029OpenAlexW2135472198MaRDI QIDQ1024996
Publication date: 18 June 2009
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.3029
Related Items (11)
Optimal identifying codes of two families of Cayley graphs ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ New bounds for contagious sets ⋮ On the size of identifying codes in triangle-free graphs ⋮ Identifying codes of the direct product of two cliques ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Identifying codes of corona product graphs ⋮ Locating-Domination and Identification ⋮ Open locating-dominating sets in circulant graphs ⋮ Identifying codes and searching with balls in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On identifying codes in binary Hamming spaces
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Structural properties of twin-free graphs
- Codes identifying sets of vertices in random networks
- New bounds on binary identifying codes
- Improved bounds on identifying codes in binary Hamming spaces
- Locating sensors in paths and cycles: the case of 2-identifying codes
- Identifying codes of cycles
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- A linear algorithm for minimum 1-identifying codes in oriented trees
- On a new class of codes for identifying vertices in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- On codes identifying sets of vertices in Hamming spaces
This page was built for publication: On the size of identifying codes in binary hypercubes
