On regular sets in Cayley sum graphs
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).
- A NOTE ON REGULAR SETS IN CAYLEY GRAPHS
- A survey of perfect codes
- Characterization of subgroup perfect codes in Cayley graphs
- Characterizing subgroup perfect codes by 2-subgroups
- Cyclotomic graphs and perfect codes
- Diameters and Eigenvalues
- Efficient dominating sets in circulant graphs
- Independent perfect domination sets in Cayley graphs
- On Cayley sum graphs of non-abelian groups
- On subgroup perfect codes in Cayley graphs
- On subgroup perfect codes in Cayley sum graphs
- Perfect codes in Cayley graphs
- Perfect codes in Cayley sum graphs
- Perfect codes in circulant graphs
- Perfect codes in graphs
- Regular sets in Cayley graphs
- Subgroup Perfect Codes in Cayley Graphs
- Subgroup perfect codes in Cayley sum graphs
- Subgroup regular sets in Cayley graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Total perfect codes in Cayley graphs
This page was built for publication: On regular sets in Cayley sum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862848)
