Article

Automorphisms of cubic Cayley graphs of order

Department of Mathematics, Beijing Jiaotong University, Beijing 100044, PR China
Discrete Mathematics (Impact Factor: 0.57). 05/2009; 309(9):2687-2695. DOI: 10.1016/j.disc.2008.06.023
Source: DBLP

ABSTRACT In this paper the automorphism groups of connected cubic Cayley graphs of order 2pq for distinct odd primes p and q are determined. As an application, all connected cubic non-symmetric Cayley graphs of order 2pq are classified and this, together with classifications of connected cubic symmetric graphs and vertex-transitive non-Cayley graphs of order 2pq given by the last two authors, completes a classification of connected cubic vertex-transitive graphs of order 2pq.

1 Follower
 · 
159 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Let $A_n$ be the alternating group of even permutations of $X:=\{1,2,...,n\}$ and ${\mathcal E}_n$ the set of even derangements on $X.$ Denote by $A\T_n^q$ the tensor product of $q$ copies of $A\T_n,$ where the Cayley graph $A\T_n:=\T(A_n,{\mathcal E}_n)$ is called the even derangement graph. In this paper, we intensively investigate the properties of $A\T_n^q$ including connectedness, diameter, independence number, clique number, chromatic number and the maximum-size independent sets of $A\T_n^q.$ By using the result on the maximum-size independent sets $A\T_n^q$, we completely determine the full automorphism groups of $A\T_n^q.$
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We prove that the full automorphism group of the derangement graph Γ n (n≥3) is equal to (R(S n )⋊Inn(S n ))⋊Z 2 , where R(S n ) and Inn(S n ) are the right regular representation and the inner automorphism group of S n respectively, and Z 2 =(φ) with the mapping φ:σ φ =σ -1 , ∀σ∈S n . Moreover, all orbits on the edge set of Γ n (n≥3) are determined.
    The electronic journal of combinatorics 01/2011; 18. · 0.57 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A Cayley graph Cay(G, S) on a group G is said to be normal if the right regular representation R(G) of G is normal in the full automorphism group of Cay(G, S). In this paper, all connected tetravalent non-normal Cayley graphs of order 4p are constructed explicitly for each prime p. As a result, there are fifteen sporadic and eleven infinite families of tetravalent non-normal Cayley graphs of order 4p.
    The electronic journal of combinatorics 01/2009; 16. · 0.57 Impact Factor

Preview

Download
6 Downloads
Available from