On non-normal subgroup perfect codes
Combinatorics
2021-09-16 v1
Abstract
Let be a graph. A subset is a \emph{perfect code} of if is a coclique of with the property that any vertex in is adjacent to exactly one vertex in . Given a finite group with identity element and , is a \emph{subgroup perfect code} of if there exists an inverse-closed subset such that is a perfect code of the Cayley graph of with connection set . In this short note, we give an infinite family of finite groups admitting a non-normal subgroup perfect code such that there exists with but , for all ; thus, answering a question raised by Wang, Xia, and Zhou in [Perfect sets in Cayley graphs. {\it arXiv preprint} arXiv:2006.05100, 2020].
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