Pentavalent symmetric graphs of order 12\(p\) (Q665754)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pentavalent symmetric graphs of order 12p |
scientific article; zbMATH DE number 6012337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pentavalent symmetric graphs of order 12\(p\) |
scientific article; zbMATH DE number 6012337 |
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
0.9616082906723022
0 references
0.9574101567268372
0 references
0.9561821818351746
0 references
0.9480141401290894
0 references
0.9457560181617736
0 references
