Pages that link to "Item:Q2830060"
From MaRDI portal
The following pages link to Minimum-Density Identifying Codes in Square Grids (Q2830060):
Displaying 15 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)
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- An optimal strongly identifying code in the infinite triangular grid (Q986692) (← links)
- New bounds for codes identifying vertices in graphs (Q1283874) (← links)
- Periodicity of identifying codes in strips (Q1708274) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- The number of completely different optimal identifying codes in the infinite square grid (Q2410258) (← links)
- New lower bound for 2-identifying code in the square grid (Q2446847) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
- Minimum density of identifying codes of king grids (Q5920174) (← links)
- Density of identifying codes of hexagonal grids with finite number of rows (Q6550909) (← links)