Subgroup regular sets in Cayley graphs

DOI10.1016/J.DISC.2022.113023MaRDI QIDQ6367195arXivFDO

Authors Yanpeng Wang, Binzhou Xia, Sanming Zhou

Publication date 9 May 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DISC.2022.113023

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Theory of error-correcting codes and error-detecting codes (94B99)

arXiv classification

math.CO

Abstract: Let $Gamma$ be a graph with vertex set $V$, and let $a$ and $b$ be nonnegative integers. A subset $C$ of $V$ is called an $(a,b)$-regular set in $Gamma$ if every vertex in $C$ has exactly $a$ neighbors in $C$ and every vertex in $VsetminusC$ has exactly $b$ neighbors in $C$. In particular, $(0,1)$-regular sets and $(1,1)$-regular sets in $Ga$ are called perfect codes and total perfect codes in $Ga$, respectively. A subset $C$ of a group $G$ is said to be an $(a,b)$-regular set of $G$ if there exists a Cayley graph of $G$ which admits $C$ as an $(a,b)$-regular set. In this paper we prove that, for any generalized dihedral group $G$ or any group $G$ of order $4p$ or $pq$ for some primes $p$ and $q$, if a nontrivial subgroup $H$ of $G$ is a $(0,1)$-regular set of $G$, then it must also be an $(a,b)$-regular set of $G$ for any $0leqslantaleqslant|H|-1$ and $0leqslantbleqslant|H|$ such that $a$ is even when $|H|$ is odd. A similar result involving $(1,1)$-regular sets of such groups is also obtained in the paper.

This page was built for publication: Subgroup regular sets in Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367195)