On non-normal subgroup perfect codes

Abstract: Let

X = (V, E)

be a graph. A subset

C s u b s e t e q V (X)

is a emph{perfect code} of

X

if

C

is a coclique of

X

with the property that any vertex in

V (X) s e t m i n u s C

is adjacent to exactly one vertex in

C

. Given a finite group

G

with identity element

e

and

H l e q G

,

H

is a emph{subgroup perfect code} of

G

if there exists an inverse-closed subset

S s u b s e t e q G s e t m i n u s e

such that

H

is a perfect code of the Cayley graph

o p e r a t o r n a m e C a y (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 i n G

with

g^{2} i n H

but

(g h)^{2} e q e

, for all

h i n H

; thus, answering a question raised by Wang, Xia, and Zhou in [Perfect sets in Cayley graphs. {it arXiv preprint} arXiv:2006.05100, 2020].

Recommendations

Cites work

Cited in

(8)

This page was built for publication: On non-normal subgroup perfect codes