Saved in:
Bibliographic Details
Main Authors: Yang, Yuefeng, Ma, Xuanlong, Zeng, Qing
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2207.06743
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • A subset $C$ of the vertex set of a graph $Γ$ is called a perfect code of $Γ$ if every vertex of $Γ$ 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.