Pages that link to "Item:Q5954312"
From MaRDI portal
The following pages link to General bounds for identifying codes in some infinite regular graphs (Q5954312):
Displaying 20 items.
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- A family of optimal identifying codes in \(\mathbb Z^2\) (Q855875) (← 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)
- Adaptive identification in graphs (Q958720) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← 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)
- Optimal codes for strong identification (Q1612759) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- Identifying codes of degree 4 Cayley graphs over abelian groups (Q2346707) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid (Q2444553) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- New lower bound for 2-identifying code in the square grid (Q2446847) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
