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 -regular graph of type , that is, a graph with no automorphism of order interchanging two adjacent vertices. In this paper an infinite family of non-Cayley cubic -regular graphs of type with a solvable automorphism group is constructed. The smallest graph in this family has order 6174.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.