Pages that link to "Item:Q2706181"
From MaRDI portal
The following pages link to Bounds for codes identifying vertices in the hexagonal grid (Q2706181):
Displaying 33 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 and locating-dominating sets on paths and cycles (Q642979) (← links)
- On a new class of identifying codes in graphs (Q845971) (← 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)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- New bounds for codes identifying vertices in graphs (Q1283874) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- Watching systems in the King grid (Q2376080) (← links)
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid (Q2380272) (← 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)
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid (Q2446882) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Liar's domination (Q3057104) (← links)
- Improved Bounds for<i>r</i>-Identifying Codes of the Hex Grid (Q3094905) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← 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)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- Finding codes on infinite grids automatically (Q6614543) (← links)
- Optimal local identifying and local locating-dominating codes (Q6614544) (← links)
- Optimal error-detection system for identifying codes (Q6663966) (← links)