Perfect codes in Cayley graphs of abelian groups
Abstract
Abstract A perfect code in a graph $$\Gamma = (V, E)$$ Γ = ( V , E ) is a subset C of V such that no two vertices in C are adjacent and every vertex in $$V \setminus C$$ V \ C is adjacent to exactly one vertex in C . A total perfect code in $$\Gamma $$ Γ is a subset C of V such that every vertex of $$\Gamma $$ Γ is adjacent to exactly one vertex in C . In this paper we prove several results on perfect codes and total perfect codes in Cayley graphs of finite abelian groups.
Fields of Study & Subjects
Coding theory and cryptography
graph theory and CDMA systems
Advanced Breast Cancer Therapies
Publication details
- Journal / source
- Designs Codes and Cryptography
- Publisher
- Springer Science and Business Media LLC
- Volume
- 94
- Issue
- 4
- Publication date
- 1 April 2026
- Language
- EN