2025/05/26 by Dong, Chengcheng, Yang, Yuefeng, Dong, Changchang
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2505.19677
For a graph Γ=(VΓ,EΓ), a subset D of VΓ is a perfect code in Γ if every vertex of Γ is dominated by exactly one vertex in D. In this paper, we classify all connected quartic Cayley graphs on generalized dihedral groups admitting a perfect code, and determine all perfect codes in such graphs.