On regular sets in Cayley sum graphs (Q6862848)

The paper studies \((\kappa,\tau)\)-regular sets in Cayley sum graphs \(\mathrm{CS}(G,X)\), with emphasis on the case where the regular set is a subgroup \(H\le G\). This notion extends perfect codes \((0,1)\) and total perfect codes \((1,1)\), which have been extensively studied previously.\N\NFor abelian groups, the authors give necessary and sufficient conditions on the parameters \(\kappa\) and \(\tau\) for a given subgroup to be a regular set, depending on whether the connection set contains the subgroup of squares or is square-free (Theorems 3.1--3.5). These results extend earlier work on subgroup perfect codes to general \((\kappa,\tau)\)-regular sets.\N\NFor dihedral groups \(D_{2n}\), the authors give a complete classification of Cayley sum graphs admitting a given subgroup as a \((\kappa,\tau)\)-regular set, according to the type of subgroup involved (Theorems 4.1--4.3).