Pentavalent symmetric graphs of order 12\(p\) (Q665754): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Song-Tao Guo / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Yan Quan Feng / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Magma / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 01:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pentavalent symmetric graphs of order 12\(p\) |
scientific article |
Statements
Pentavalent symmetric graphs of order 12\(p\) (English)
0 references
6 March 2012
0 references
Summary: A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, a complete classification of connected pentavalent symmetric graphs of order 12\(p\) is given for each prime \(p\). As a result, a connected pentavalent symmetric graph of order 12\(p\) exists if and only if \(p = 2, 3, 5\) or 11, and up to isomorphism, there are only nine such graphs: one for each \(p = 2, 3\) and 5, and six for \(p = 11\).
0 references
symmetric graph
0 references
\(s\)-arc-transitive graph
0 references
\(s\)-transitive graph
0 references
