Subgroup Perfect Codes of At-Groups and Their Applications

Abstract

A subset C of the vertex set of a graph is called a perfect code in if every vertex of is at distance no more than 1 to exactly one vertex of C. A subgroup H of a group G is called a subgroup perfect code of G if H is a perfect code in some Cayley graph of G. Recently, Zhang reveals that the study of subgroup perfect codes of finite groups naturally reduces to the case of p-groups, especially 2-groups. Based on the combined works of Berkovich, Janko and Zhang, every p-group is an At-group. In this work, we establish a complete classification of subgroup perfect codes of At-groups for t ∈\0, 1\. Moreover, subgroup perfect codes of finite groups with abelian Sylow 2-subgroups are also characterized.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…