CUBIC VERTEX-TRANSITIVE GRAPHS OF ORDER 4p
Zhou Jinxin
Abstract
Zhou Jinxin
Abstract
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=-1(mod 2p).
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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=-1(mod 2p).
Key concepts: Combinatorics, Petersen graph, Mathematics, Vertex-transitive graph, Cubic graph, Symmetric graph, Regular graph, Distance-regular graph