Pentavalent Symmetric Graphs of Order $12p$
Songtao Guo, Jin‐Xin Zhou, Yan‐Quan Feng · The Electronic Journal of Combinatorics · 2011
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2011
Abstract
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 $12p$ is given for each prime $p$. As a result, a connected pentavalent symmetric graph of order $12p$ 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$.
Open the resolved locator · 10.37236/720
Metadata licence: OpenAlex metadata (CC0)