ScholarLens Back to search
2009•Chinese Annals of MathematicsRequires access

Cubic Vertex-Transitive Graphs of Order 4p

Yantao Li

Open publisher page 6 citations

Abstract

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of the graph respectively.Let p be a prime.Xu et al.[Chin.Ann.Math.,2004,25B(4):545-554]classified the connected cubic symmetric graphs of order 4p.This paper gives a classification of connected cubic vertex-transitive graphs of order 4p.As a result,the number of pairwise non-isomorphic connected cubic vertex-transitive graph of order 4p is 2 for p = 2,4 for p = 3,8 for p = 5,6 for p = 7, 5 +p-3/2 for p≥11 with 4 |(p-1) and 3 + p-3/2 for p11 with 4(p -1).

About this research paper

What this paper is about

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of the graph respectively.Let p be a prime.Xu et al.[Chin.Ann.Math.,2004,25B(4):545-554]classified the connected cubic symmetric graphs of order 4p.This paper gives a classification of connected cubic vertex-transitive graphs of order 4p.As a result,the number of pairwise non-isomorphic connected cubic vertex-transitive graph of order 4p is 2 for p = 2,4 for p = 3,8 for p = 5,6 for p = 7, 5 +p-3/2 for p≥11 with 4 |(p-1) and 3 + p-3/2 for p11 with 4(p -1).

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of the graph respectively.Let p be a prime.Xu et al.[Chin.Ann.Math.,2004,25B(4):545-554]classified the connected cubic symmetric graphs of order 4p.This paper gives a classification of connected cubic vertex-transitive graphs of order 4p.As a result,the number of pairwise non-isomorphic connected cubic vertex-transitive graph of order 4p is 2 for p = 2,4 for p = 3,8 for p = 5,6 for p = 7, 5 +p-3/2 for p≥11 with 4 |(p-1) and 3 + p-3/2 for p11 with 4(p -1).

Key concepts: Combinatorics, Mathematics, Transitive relation, Symmetric graph, Vertex (graph theory), Vertex-transitive graph, Graph, Automorphism group

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Cubic Vertex-Transitive Graphs of Order 4p — Research Paper | ScholarLens