On non-normal subgroup perfect codes

Abstract

Let X = (V,E) be a graph. A subset C ⊂eq V(X) is a perfect code of X if C is a coclique of X with the property that any vertex in V(X) C is adjacent to exactly one vertex in C. Given a finite group G with identity element e and H≤ G, H is a subgroup perfect code of G if there exists an inverse-closed subset S ⊂eq G \e\ such that H is a perfect code of the Cayley graph Cay(G,S) of G with connection set S. In this short note, we give an infinite family of finite groups G admitting a non-normal subgroup perfect code H such that there exists g∈ G with g2∈ H but (gh)2 ≠ e, for all h ∈ H; thus, answering a question raised by Wang, Xia, and Zhou in [Perfect sets in Cayley graphs. arXiv preprint arXiv:2006.05100, 2020].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…