The following pages link to (Q5393489):
Displaying 9 items.
- On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube (Q4634300) (← links)
- Bounds on r-identifying codes in q-ary Lee space (Q4986273) (← links)