2000 character limit reached
Automorphism groups of Cayley graphs generated by general transposition sets (2401.17860v1)
Published 31 Jan 2024 in math.CO and cs.DM
Abstract: In this paper we study the Cayley graph $\mathrm{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 Ganesan in arXiv:1703.08109, showing that $\mathrm{Cay}(S_n,T)$ is normal if and only if the transposition graph is not $C_4$ or $K_n$.
- Norman Biggs. Algebraic graph theory. Number 67 in Cambridge Mathematical Library. Cambridge university press, 1993.
- Yan-Quan Feng. Automorphism groups of cayley graphs on symmetric groups with generating transposition sets. Journal of Combinatorial Theory, Series B, 96(1):67–72, 2006.
- Ashwin Ganesan. Automorphism groups of cayley graphs generated by connected transposition sets. Discrete Mathematics, 313(21):2482–2485, 2013.
- Ashwin Ganesan. Automorphism group of the complete transposition graph. Journal of Algebraic Combinatorics, 42:793–801, 2015.
- Ashwin Ganesan. On the automorphism group of cayley graphs generated by transpositions. Australasian Journal of Combinatorics, 64:432–436, 2016.
- Ashwin Ganesan. Cayley graphs and symmetric interconnection networks. arXiv:1703.08109, 2017.
- Algebraic graph theory, volume 207. Springer Science & Business Media, 2001.
- Chris D Godsil. On the full automorphism group of a graph. Combinatorica, 1:243–256, 1981.
- Marie-Claude Heydemann. Cayley graphs and interconnection networks, pages 167–224. Springer Netherlands, Dordrecht, 1997.
- Mark R. Jerrum. The complexity of finding minimum-length generator sequences. Theoretical Computer Science, 36:265–289, 1985.
- Changing the gate order for optimal lnn conversion. In A. De Vos and R. Wille, editors, Reversible Computation, pages 89–101, Berlin, Heidelberg, 2012. Springer Berlin Heidelberg.
- Exploiting symmetries in optimal quantum circuit design. arXiv:2401.08262, 2024.
- Bisection width of transposition graphs. Discrete Applied Mathematics, 84(1-3):221–235, 1998.
- Hassler Whitney. Congruent graphs and the connectivity of graphs. American Journal of Mathematics, 54:150–168, 1932.
- Ming-Yao Xu. Automorphism groups and isomorphisms of cayley digraphs. Discrete Mathematics, 182:309–319, 1998.
- Automorphism groups of bubble sort graphs and modified bubble sort graphs. Advances in Mathematics (China), 34(4):441–447, 2005.