Pages that link to "Item:Q2492191"
From MaRDI portal
The following pages link to Monotonicity of the minimum cardinality of an identifying code in the hypercube (Q2492191):
Displaying 13 items.
- On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube (Q4634300) (← links)
