Pages that link to "Item:Q5960786"
From MaRDI portal
The following pages link to Identifying codes with small radius in some infinite regular graphs (Q5960786):
Displaying 13 items.
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- A family of optimal identifying codes in \(\mathbb Z^2\) (Q855875) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
