Pages that link to "Item:Q5960786"
From MaRDI portal
The following pages link to Identifying codes with small radius in some infinite regular graphs (Q5960786):
Displayed 34 items.
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← 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)
- Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- On the identification problems in products of cycles (Q1420607) (← 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)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- Locating and identifying codes in circulant graphs (Q2244371) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- Identifying codes of degree 4 Cayley graphs over abelian groups (Q2346707) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- Watching systems in the King grid (Q2376080) (← links)
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847) (← 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)
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← 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)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- On the Structure of Identifiable Graphs (Q3439386) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
- Minimum density of identifying codes of king grids (Q5920174) (← links)