Perfect codes in quintic Cayley graphs on abelian groups
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.