Designs, Codes and Cryptography Прикладные компьютерные науки

Perfect codes in Cayley graphs of abelian groups

Peter J. Cameron, Roro Sihui Yap, Sanming Zhou
Springer Nature · 2026-04-01 · DOI 10.1007/s10623-026-01821-1

Аннотация

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.

Читать у издателя →