Identifying codes with small radius in some infinite regular graphs
From MaRDI portal
Recommendations
- General bounds for identifying codes in some infinite regular graphs
- scientific article; zbMATH DE number 1522566
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Completely regular codes in Johnson and Grassmann graphs with small covering radii
- On the size of identifying codes in triangle-free graphs
- Minimum sizes of identifying codes in graphs differing by one vertex
- Minimum sizes of identifying codes in graphs differing by one edge
- Minimal identifying codes in trees and planar graphs with large girth
- Codes from incidence matrices of some regular graphs
- Lower bounds for identifying codes in some infinite grids
Cited in
(50)- Paths and cycles identifying vertices in twisted cubes
- Covering codes in Sierpiński graphs
- New lower bound for 2-identifying code in the square grid
- The minimum density of an identifying code in the king lattice.
- scientific article; zbMATH DE number 2186985 (Why is no real title available?)
- On the identification problems in products of cycles
- New identifying codes in the binary Hamming space
- A family of optimal identifying codes in \(\mathbb Z^2\)
- Identifying codes and searching with balls in graphs
- Identifying codes of degree 4 Cayley graphs over abelian groups
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Identifying codes in some subgraphs of the square lattice
- Identifying codes and locating-dominating sets on paths and cycles
- Locating and identifying codes in circulant graphs
- On robust identification in the square and King grids
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- An optimal locating-dominating set in the infinite triangular grid
- Optimal bounds on codes for location in circulant graphs
- Watching systems in the King grid
- On identification in the triangular grid
- Locating-domination and identification
- Minimum density of identifying codes of king grids
- Minimum density of identifying codes of king grids
- On a new class of identifying codes in graphs
- Finding codes on infinite grids automatically
- Optimal local identifying and local locating-dominating codes
- On Iiro Honkala's contributions to identifying codes
- On vertex-robust identifying codes of level three.
- Identifying and locating-dominating codes on chains and cycles
- Optimal identifying codes in the infinite 3-dimensional king grid
- On the Structure of Identifiable Graphs
- On identifying codes in the hexagonal mesh
- Fault-tolerant detection systems on the infinite King grid
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
- On identifying codes
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- General bounds for identifying codes in some infinite regular graphs
- Adaptive identification in graphs
- A linear algorithm for minimum 1-identifying codes in oriented trees
- Sphere coverings and identifying codes
- Locating and identifying codes in circulant networks
- On \(r\)-locating-dominating sets in paths
- On identifying codes that are robust against edge changes
- Optimal error-detection system for identifying codes
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Identifying codes for generalized quadrangles
- Density of identifying codes of hexagonal grids with finite number of rows
This page was built for publication: Identifying codes with small radius in some infinite regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960786)
