Year: 2026
Type: preprint
Abstract: A subset $D$ of the vertex set of a graph is called an $(a,b)$-regular set if each vertex in $D$ has exactly $a$ neighbors in $D$, and each vertex outside $D$ has exactly $b$ neighbors in $D$. A proper subgroup $H$ of $G$ is called an $(a,b)$-regular set of $(G,α)$ if it is an $(a,b)$-regular set of $GC(G,S,α)$ for some generalized Cayley subset $S$ of $G$ induced by the involutory automorphism $α$. This paper investigates subgroup $(0,b)$-regular sets in generalized Cayley graphs. We first obtain some necessary and sufficient conditions for a proper subgroup of a group $G$ to be a $(0,b)$-regular set of a generalized Cayley graph. In particular, we show that a proper normal subgroup $H$ of $G$ is a $(0,b)$-regular set of $(G,α)$ if and only if $H$ is a perfect code of $(G,α)$ for some odd integer $b,$ which generalizes the result in [F.S. Seiedali, Z. Akhlaghi, B. Khosravi. Generalized Cayley graphs and perfect code. Discrete Math. 2026]. Furthermore, for connected generalized Cayley graphs with $α$-normal generalized Cayley subsets, we characterize subgroup $(0,b)$-regular sets via equitable partitions.
Source: arXiv (Cornell University)
Authors: Liao, Qianfen, Liu, Weijun, Zhang, Peng-Li
Language: English
Topic: Finite Group Theory Research
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7225988581
