Pages that link to "Item:Q942141"
From MaRDI portal
The following pages link to Identifying codes of cycles with odd orders (Q942141):
Displayed 16 items.
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← 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)
- Fault tolerance of hypercube like networks: spanning laceability under edge faults (Q2192380) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Locating-Domination and Identification (Q3384611) (← links)