Perfect codes in quartic Cayley graphs of generalized dihedral groups
Abstract
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.
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.