English

Automorphisms of Cayley graphs generated by transposition sets

Discrete Mathematics 2013-06-18 v2 Combinatorics

Abstract

Let SS be a set of transpositions such that the girth of the transposition graph of SS is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group HH generated by SS is the semidirect product R(H)\Aut(H,S)R(H) \rtimes \Aut(H,S), where R(H)R(H) is the right regular representation of HH and \Aut(H,S)\Aut(H,S) is the set of automorphisms of HH that fixes SS setwise. Furthermore, if the connected components of the transposition graph of SS are isomorphic to each other, then \Aut(H,S)\Aut(H,S) is isomorphic to the automorphism group of the line graph of the transposition graph of SS. This result is a common generalization of previous results by Feng, Ganesan, Harary, Mirafzal, and Zhang and Huang. As another special case, we obtain the automorphism group of the extended cube graph that was proposed as a topology for interconnection networks.

Cite

@article{arxiv.1303.5974,
  title  = {Automorphisms of Cayley graphs generated by transposition sets},
  author = {Ashwin Ganesan},
  journal= {arXiv preprint arXiv:1303.5974},
  year   = {2013}
}
R2 v1 2026-06-21T23:47:22.520Z