Perfect codes in quartic Cayley graphs of generalized dihedral groups
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912401808424960 |
|---|---|
| author | Dong, Chengcheng Yang, Yuefeng Dong, Changchang |
| author_facet | Dong, Chengcheng Yang, Yuefeng Dong, Changchang |
| contents | For a graph $Γ=(VΓ,EΓ)$, a subset $D$ of $VΓ$ is a perfect code in $Γ$ if every vertex of $Γ$ is dominated by exactly one vertex in $D$. In this paper, we classify all connected quartic Cayley graphs on generalized dihedral groups admitting a perfect code, and determine all perfect codes in such graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_19677 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Perfect codes in quartic Cayley graphs of generalized dihedral groups Dong, Chengcheng Yang, Yuefeng Dong, Changchang Combinatorics For a graph $Γ=(VΓ,EΓ)$, a subset $D$ of $VΓ$ is a perfect code in $Γ$ if every vertex of $Γ$ is dominated by exactly one vertex in $D$. In this paper, we classify all connected quartic Cayley graphs on generalized dihedral groups admitting a perfect code, and determine all perfect codes in such graphs. |
| title | Perfect codes in quartic Cayley graphs of generalized dihedral groups |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2505.19677 |