Pages that link to "Item:Q2462318"
From MaRDI portal
The following pages link to Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318):
Displaying 14 items.
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Identifying codes of cycles with odd orders (Q942141) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Locating-Domination and Identification (Q3384611) (← links)