Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (16)
  1. Norman Biggs. Algebraic graph theory. Number 67 in Cambridge Mathematical Library. Cambridge university press, 1993.
  2. 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.
  3. Ashwin Ganesan. Automorphism groups of cayley graphs generated by connected transposition sets. Discrete Mathematics, 313(21):2482–2485, 2013.
  4. Ashwin Ganesan. Automorphism group of the complete transposition graph. Journal of Algebraic Combinatorics, 42:793–801, 2015.
  5. Ashwin Ganesan. On the automorphism group of cayley graphs generated by transpositions. Australasian Journal of Combinatorics, 64:432–436, 2016.
  6. Ashwin Ganesan. Cayley graphs and symmetric interconnection networks. arXiv:1703.08109, 2017.
  7. Algebraic graph theory, volume 207. Springer Science & Business Media, 2001.
  8. Chris D Godsil. On the full automorphism group of a graph. Combinatorica, 1:243–256, 1981.
  9. Marie-Claude Heydemann. Cayley graphs and interconnection networks, pages 167–224. Springer Netherlands, Dordrecht, 1997.
  10. Mark R. Jerrum. The complexity of finding minimum-length generator sequences. Theoretical Computer Science, 36:265–289, 1985.
  11. 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.
  12. Exploiting symmetries in optimal quantum circuit design. arXiv:2401.08262, 2024.
  13. Bisection width of transposition graphs. Discrete Applied Mathematics, 84(1-3):221–235, 1998.
  14. Hassler Whitney. Congruent graphs and the connectivity of graphs. American Journal of Mathematics, 54:150–168, 1932.
  15. Ming-Yao Xu. Automorphism groups and isomorphisms of cayley digraphs. Discrete Mathematics, 182:309–319, 1998.
  16. Automorphism groups of bubble sort graphs and modified bubble sort graphs. Advances in Mathematics (China), 34(4):441–447, 2005.

Summary

We haven't generated a summary for this paper yet.