Almost all standard double covers of abelian Cayley graphs have smallest possible automorphism groups
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908793231638528 |
|---|---|
| author | Xia, Binzhou Zhang, Zhishuo Zheng, Shasha |
| author_facet | Xia, Binzhou Zhang, Zhishuo Zheng, Shasha |
| contents | The standard double cover of a graph $Γ$ is the direct product $Γ\times K_2$. A graph $Γ$ is said to be stable if all the automorphisms of $Γ\times K_2$ come from its factors. Although the study of stability has attracted significant attention, particularly regarding Cayley graphs of abelian groups, a complete classification remains elusive even for Cayley graphs of cyclic groups. In this paper, we study the asymptotic enumeration of both labeled and unlabeled Cayley graphs of abelian groups whose standard double cover has the smallest possible automorphism group. As a corollary, in both the labeled and unlabeled settings, we conclude that the proportion of stable Cayley graphs of an abelian group of order $r$ approaches $1$ as $r\rightarrow\infty$, proving that almost all Cayley graphs of finite abelian groups are stable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20214 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Almost all standard double covers of abelian Cayley graphs have smallest possible automorphism groups Xia, Binzhou Zhang, Zhishuo Zheng, Shasha Combinatorics Group Theory The standard double cover of a graph $Γ$ is the direct product $Γ\times K_2$. A graph $Γ$ is said to be stable if all the automorphisms of $Γ\times K_2$ come from its factors. Although the study of stability has attracted significant attention, particularly regarding Cayley graphs of abelian groups, a complete classification remains elusive even for Cayley graphs of cyclic groups. In this paper, we study the asymptotic enumeration of both labeled and unlabeled Cayley graphs of abelian groups whose standard double cover has the smallest possible automorphism group. As a corollary, in both the labeled and unlabeled settings, we conclude that the proportion of stable Cayley graphs of an abelian group of order $r$ approaches $1$ as $r\rightarrow\infty$, proving that almost all Cayley graphs of finite abelian groups are stable. |
| title | Almost all standard double covers of abelian Cayley graphs have smallest possible automorphism groups |
| topic | Combinatorics Group Theory |
| url | https://arxiv.org/abs/2601.20214 |