Pages that link to "Item:Q845971"
From MaRDI portal
The following pages link to On a new class of identifying codes in graphs (Q845971):
Displaying 12 items.
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Locating and identifying codes in circulant graphs (Q2244371) (← links)
- On \(t\)-revealing codes in binary Hamming spaces (Q2272993) (← links)
- Tolerant location detection in sensor networks (Q2280052) (← links)
- The solid-metric dimension (Q2285129) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847) (← links)
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
