%0 Journal Article
%T Cubic Vertex-Transitive Graphs of Order 4p<br>4p阶3度点传递图
%A ZHOU Jinxin
%A <br>周进鑫
%J 系统科学与数学
%D 2008
%I 
%X 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).
%K Vertex-transitive graph
%K Cayley graph
%K non-Cayely vertex-transitive graph<br>点传递图
%K Cayley图
%K 非Cayley点传递图
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=7B74AE33391E604D40D64D01E030D3CD&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=F3090AE9B60B7ED1&sid=076A4355FDA11BCF&eid=0522AC581E488FBF&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=12