General bounds for identifying codes in some infinite regular graphs
From MaRDI portal
Summary: Consider a connected undirected graph \(G=(V,E)\) and a subset of vertices \(C\). If for all vertices \(v \in V\), the sets \(B_r(v) \cap C\) are all nonempty and pairwise distinct, where \(B_r(v)\) denotes the set of all points within distance \(r\) from \(v\), then we call \(C\) an \(r\)-identifying code. We give general lower and upper bounds on the best possible density of \(r\)-identifying codes in three infinite regular graphs.
Recommendations
Cited in
(30)- On identifying codes in the hexagonal mesh
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- The minimum density of an identifying code in the king lattice.
- Optimal codes for strong identification
- Paths and cycles identifying vertices in twisted cubes
- On identification in the triangular grid
- On the density of identifying codes in the square lattice
- Lower bounds for identifying codes in some infinite grids
- Identifying codes of degree 4 Cayley graphs over abelian groups
- On identifying codes that are robust against edge changes
- An optimal locating-dominating set in the infinite triangular grid
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- Locating and identifying codes in circulant networks
- New lower bound for 2-identifying code in the square grid
- Minimum-Density Identifying Codes in Square Grids
- scientific article; zbMATH DE number 2186985 (Why is no real title available?)
- On vertex-robust identifying codes of level three.
- Locating-domination and identification
- Bounds for identifying codes in terms of degree parameters
- Identifying codes with small radius in some infinite regular graphs
- Identification in \(\mathbb Z^2\) using Euclidean balls
- Density of identifying codes of hexagonal grids with finite number of rows
- On Iiro Honkala's contributions to identifying codes
- Finding codes on infinite grids automatically
- On a new class of identifying codes in graphs
- A family of optimal identifying codes in \(\mathbb Z^2\)
- On robust identification in the square and King grids
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- Adaptive identification in graphs
This page was built for publication: General bounds for identifying codes in some infinite regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954312)
