Pentavalent symmetric graphs of order \(2pq\) (Q641203): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q188311 |
||
Property / author | |||
Property / author: Yan Quan Feng / rank | |||
Revision as of 15:45, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pentavalent symmetric graphs of order \(2pq\) |
scientific article |
Statements
Pentavalent symmetric graphs of order \(2pq\) (English)
0 references
21 October 2011
0 references
In this paper, all connected pentavalent symmetric (1-arc-transitive) graphs of order \(2pq\) are classified, where \(p\) and \(q\) are distinct primes. It follows from the classification that there are two such graphs of order \(4p\) and, for odd primes \(p\) and \(q\), there is an infinite family of connected graphs of order \(2pq\) with solvable automorphism groups and there are seven sporadic ones with nonsolvable automorphism groups. The paper uses sophisticated group theoretic tools and the Sabidussi construction of 1-arc-transitive graphs as coset graphs Cos\((G,H,HaH)\) with \(H\leq G\), \(a^2\in H\) and \(\langle H, a \rangle = G\). The Magma computer algebra system is also used to determine when the coset graphs constructed are isomorphic.
0 references
arc-transitive graph
0 references
pentavalent symmetric graph
0 references
\(s\)-regular graph
0 references
automorphism group
0 references
Sabidussi construction
0 references
coset graphs
0 references
Magma computer algebra system
0 references