Identifying codes of degree 4 Cayley graphs over abelian groups
From MaRDI portal
Publication:2346707
DOI10.3934/amc.2015.9.129zbMath1369.94606arXiv1412.5830MaRDI QIDQ2346707
Ramón Beivide, Cristóbal Camarero, Carmen Martínez
Publication date: 3 June 2015
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5830
05C90: Applications of graph theory
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
94B25: Combinatorial codes
Related Items
Cites Work
- Adaptive identification in Torii in the King lattice
- Perfect codes in direct products of cycles-a complete characterization
- Adaptive identification in graphs
- Hamiltonian decomposition of Cayley graphs of degree 4
- On the density of identifying codes in the square lattice
- On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
- A Combinatorial Problem Related to Multimodule Memory Organizations
- On a new class of codes for identifying vertices in graphs
- Modeling Toroidal Networks with the Gaussian Integers
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Optimal distance networks of low degree for parallel computers
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Complete Residue Systems in the Gaussian Integers
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
