Automorphism group of the complete transposition graph

From MaRDI portal




Abstract: The complete transposition graph is defined to be the graph whose vertices are the elements of the symmetric group Sn, and two vertices alpha and are adjacent in this graph iff there is some transposition (i,j) such that . Thus, the complete transposition graph is the Cayley graph Cay(Sn,S) of the symmetric group generated by the set S of all transpositions. An open problem in the literature is to determine which Cayley graphs are normal. It was shown recently that the Cayley graph generated by 4 cyclically adjacent transpositions is not normal. In the present paper, it is proved that the complete transposition graph is not a normal Cayley graph, for all nge3. Furthermore, the automorphism group of the complete transposition graph is shown to equal [ Aut(Cay(S_n,S)) = (R(S_n) times Inn(S_n)) times mathbb{Z}_2, ] where R(Sn) is the right regular representation of Sn, Inn(Sn) is the group of inner automorphisms of Sn, and mathbbZ2=langlehangle, where h is the map alphamapstoalpha1.




Cited in
(23)






This page was built for publication: Automorphism group of the complete transposition graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887942)