Automorphism groups of a class of cubic Cayley graphs on symmetric groups

Abstract

Let Sn denote the symmetric group of degree n with n≥ 3. Set S=\cn=(1\ 2… \ n),cn-1,(1\ 2)\. Let n=Cay(Sn,S) be the Cayley graph on Sn with respect to S. In this paper, we show that n (n≥ 13) is a normal Cayley graph, and that the full automorphism group of n is equal to Aut(n)=R(Sn) (φ) Sn Z2, where R(Sn) is the right regular representation of Sn, φ=(1\ 2)(3\ n)(4\ n-1)(5\ n-2)·s (∈ Sn), and Inn(φ) is the inner isomorphism of Sn induced by φ.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…