Pages that link to "Item:Q1010656"
From MaRDI portal
The following pages link to Identifying codes of Cartesian product of two cliques of the same size (Q1010656):
Displayed 15 items.
- On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← 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)
- Tolerant location detection in sensor networks (Q2280052) (← 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)