Automorphism Groups of Cayley Graphs Generated by General Transposition Sets
In this paper we study the Cayley graph $Cay(S_n,T)$ of the symmetric group $S_n$ generated by a set of transpositions $T$. We show that for $n\geq 5$ the Cayley graph is normal. As a corollary, we show that its automorphism group is a direct product of $S_n$ and the automorphism group of the transposition graph associated to $T$. This provides an affirmative answer to a conjecture raised by A. Ganesan, Cayley graphs and symmetric interconnection networks, showing that $Cay(S_n,T)$ is normal if and only if the transposition graph is not $C_4$ or $K_n$.
Authors
- Frank de Meijer (ORCID: https://orcid.org/0000-0002-1910-0699)
- Dion Gijswijt (ORCID: https://orcid.org/0000-0003-0734-4511)
Institutions
- Delft University of Technology (NL)
Publication Details
- Journal
- The Electronic Journal of Combinatorics
- Published
- 2024-09-05
- DOI
- https://doi.org/10.37236/12771
- Citations
- 2
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.42