English

On non-normal subgroup perfect codes

Combinatorics 2021-09-16 v1

Abstract

Let X=(V,E)X = (V,E) be a graph. A subset CV(X)C \subseteq V(X) is a \emph{perfect code} of XX if CC is a coclique of XX with the property that any vertex in V(X)CV(X)\setminus C is adjacent to exactly one vertex in CC. Given a finite group GG with identity element ee and HGH\leq G, HH is a \emph{subgroup perfect code} of GG if there exists an inverse-closed subset SG{e}S \subseteq G\setminus \{e\} such that HH is a perfect code of the Cayley graph Cay(G,S)\operatorname{Cay}(G,S) of GG with connection set SS. In this short note, we give an infinite family of finite groups GG admitting a non-normal subgroup perfect code HH such that there exists gG g\in G with g2Hg^2\in H but (gh)2e(gh)^2 \neq e, for all hHh \in H; thus, answering a question raised by Wang, Xia, and Zhou in [Perfect sets in Cayley graphs. {\it arXiv preprint} arXiv:2006.05100, 2020].

Keywords

Cite

@article{arxiv.2109.06993,
  title  = {On non-normal subgroup perfect codes},
  author = {Angelot Behajaina and Roghayeh Maleki and Andriaherimanana Sarobidy Razafimahatratra},
  journal= {arXiv preprint arXiv:2109.06993},
  year   = {2021}
}

Comments

6 pages

R2 v1 2026-06-24T05:58:18.977Z