On cubic symmetric non-Cayley graphs with solvable automorphism groups
classification
🧮 math.CO
keywords
automorphismgraphcubicsolvablegraphssymmetricfamilygroup
read the original abstract
It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a Cayley graph or a $2$-regular graph of type $2^2$, that is, a graph with no automorphism of order $2$ interchanging two adjacent vertices. In this paper an infinite family of non-Cayley cubic $2$-regular graphs of type $2^2$ with a solvable automorphism group is constructed. The smallest graph in this family has order 6174.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.