Pages that link to "Item:Q986692"
From MaRDI portal
The following pages link to An optimal strongly identifying code in the infinite triangular grid (Q986692):
Displaying 14 items.
- Optimal lower bound for 2-identifying codes in the hexagonal grid (Q456287) (← links)
- Identifying codes for infinite triangular grids with a finite number of rows (Q526246) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- An optimal edge-robust identifying code in the triangular lattice (Q1890400) (← links)
- Lower bounds for identifying codes in some infinite grids (Q1960276) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)