Pages that link to "Item:Q2409538"
From MaRDI portal
The following pages link to On minimum identifying codes in some Cartesian product graphs (Q2409538):
Displaying 9 items.
- On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
- A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
- Identifying codes of Cartesian product of two cliques of the same size (Q1010656) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← 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)
- The general position number of Cartesian products involving a factor with small diameter (Q2242842) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)