Pages that link to "Item:Q2380272"
From MaRDI portal
The following pages link to A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid (Q2380272):
Displaying 19 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)
- An optimal strongly identifying code in the infinite triangular grid (Q986692) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Lower bounds for identifying codes in some infinite grids (Q1960276) (← links)
- Open locating-dominating sets in circulant graphs (Q2062672) (← links)
- Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
- Watching systems in the King grid (Q2376080) (← links)
- Completely regular codes in the infinite hexagonal grid (Q2402205) (← links)
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid (Q2437959) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid (Q2446882) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Bounds for codes identifying vertices in the hexagonal grid (Q2706181) (← links)
- Improved Bounds for<i>r</i>-Identifying Codes of the Hex Grid (Q3094905) (← 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)
