Article

Automorphisms of cubic Cayley graphs of order 2pq

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
 · 
150 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In 1983, the second author [D. Marušič, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers n there exists a non-Cayley vertex-transitive graph on n vertices. (The term non-Cayley numbers has later been given to such integers.) Motivated by this problem, Feng [Discrete Math 248 (2002), 265–269] asked to determine the smallest valency ϑ(n) among valencies of non-Cayley vertex-transitive graphs of order n. As cycles are clearly Cayley graphs, ϑ(n)⩾3 for any non-Cayley number n.In this paper a goal is set to determine those non-Cayley numbers n for which ϑ(n) = 3, and among the latter to determine those for which the generalized Petersen graphs are the only non-Cayley vertex-transitive graphs of order n. It is known that for a prime p every vertex-transitive graph of order p, p2 or p3 is a Cayley graph, and that, with the exception of the Coxeter graph, every cubic non-Cayley vertex-transitive graph of order 2p, 4p or 2p2 is a generalized Petersen graph. In this paper the next natural step is taken by proving that every cubic non-Cayley vertex-transitive graph of order 4p2, p>7 a prime, is a generalized Petersen graph. In addition, cubic non-Cayley vertex-transitive graphs of order 2pk, where p>7 is a prime and k⩽p, are characterized. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 77–95, 2012
    Journal of Graph Theory 01/2012; 69(1):77-95. DOI:10.1002/jgt.20573 · 0.67 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A Cayley graph Cay(G,S) on a group GG is said to be normal if the right regular representation R(G)R(G) of GG is normal in the full automorphism group of Cay(G,S). In this paper all connected cubic non-normal Cayley graphs of order 4p24p2 are constructed explicitly for each odd prime pp. It is shown that there are three infinite families of cubic non-normal Cayley graphs of order 4p24p2 with pp odd prime. Note that a complete classification of cubic non-Cayley vertex-transitive graphs of order 4p24p2 was given in [K. Kutnar, D. Marus˘ic˘, C. Zhang, On cubic non-Cayley vertex-transitive graphs, J. Graph Theory 69 (2012) 77–95]. As a result, a classification of cubic vertex-transitive graphs of order 4p24p2 can be deduced.
    Discrete Mathematics 07/2012; 312(s 12–13):1940–1946. DOI:10.1016/j.disc.2012.03.012 · 0.57 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1∉S and S={s-1 | s∈S}. The Cayleygraph Cay(G, S) on G with respect to S is defined as the graph with vertex set G and edge set {{g, sg} | g∈G, s∈S}. Feng and Kwak [J Combin Theory B 97 (2007), 627–646; J Austral Math Soc 81 (2006), 153–164] classified all cubic symmetric graphs of order 4p or 2p2 and in this article we classify all cubic symmetric graphs of order 2pq, where p and q are distinct odd primes. Furthermore, a classification of all cubic vertex-transitive non-Cayley graphs of order 2pq, which were investigated extensively in the literature, is given. As a result, among others, a classification of cubic vertex-transitive graphs of order 2pq can be deduced. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 285–302, 2010
    Journal of Graph Theory 12/2010; 65:285-302. DOI:10.1002/jgt.20481 · 0.67 Impact Factor

Preview

Download
6 Downloads
Available from