Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2605.14903 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911685799837696 |
|---|---|
| author | Cockburn, Sally Hatavets, Ryhory Swartz, Will |
| author_facet | Cockburn, Sally Hatavets, Ryhory Swartz, Will |
| contents | Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a complete classification is elusive. In general, the structure of the automorphism group of a graph with twins can be simplified by separating the effect of automorphisms that permute mutually twin vertices and those that operate on the twin quotient graph. Further simplification can be achieved in twin-free, vertex-transitive graphs that have co-twins, which we define to be vertices whose neighborhoods are complementary. In this paper, we demonstrate how the these simplifications can be used provide insight into the automorphism groups and symmetry parameters of vertex-transitive graphs in general and circulant graphs in particular. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_14903 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Twins and Co-Twins in Circulant graphs Cockburn, Sally Hatavets, Ryhory Swartz, Will Combinatorics 05C25, 05C69 Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a complete classification is elusive. In general, the structure of the automorphism group of a graph with twins can be simplified by separating the effect of automorphisms that permute mutually twin vertices and those that operate on the twin quotient graph. Further simplification can be achieved in twin-free, vertex-transitive graphs that have co-twins, which we define to be vertices whose neighborhoods are complementary. In this paper, we demonstrate how the these simplifications can be used provide insight into the automorphism groups and symmetry parameters of vertex-transitive graphs in general and circulant graphs in particular. |
| title | Twins and Co-Twins in Circulant graphs |
| topic | Combinatorics 05C25, 05C69 |
| url | https://arxiv.org/abs/2605.14903 |