All Title Author
Keywords Abstract

Cubic Vertex-Transitive Graphs of Order 4p

Keywords: Vertex-transitive graph,Cayley graph,non-Cayely vertex-transitive graph

Full-Text   Cite this paper   Add to My Lib


A graph is said to be vertex-transitive, if its automorphism group is transitive on its vertices. In this paper, it is proven that a connected cubic vertex-transitive graph of order 4p (p a prime) is either a Cayley graph or isomorphic to one of the following: the generalized Petersen graph P(10,2), the Dodecahedron, the Coxeter graph, or the generalized Petersen graph P(2p,k) where k^2\equiv -1(\mod 2p).


comments powered by Disqus

Contact Us


微信:OALib Journal