Perfect codes in quintic Cayley graphs on abelian groups

MaRDI QIDQ6404956zbMATH OpenFDO

Authors Yuefeng Yang, Xuanlong Ma, Qing Zeng

Publication date 14 July 2022

Abstract: A subset $C$ of the vertex set of a graph $Gamma$ is called a perfect code of $Gamma$ if every vertex of $Gamma$ is at distance no more than one to exactly one vertex in $C$. In this paper, we classify all connected quintic Cayley graphs on abelian groups that admit a perfect code, and determine completely all perfect codes of such graphs.

This page was built for publication: Perfect codes in quintic Cayley graphs on abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404956)