Pages that link to "Item:Q4651465"
From MaRDI portal
The following pages link to On Identifying Codes in the Triangular and Square Grids (Q4651465):
Displayed 17 items.
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid (Q2437959) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- (Q5878174) (← links)