English

On cubic symmetric non-Cayley graphs with solvable automorphism groups

Combinatorics 2016-07-12 v1

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 22-regular graph of type 222^2, that is, a graph with no automorphism of order 22 interchanging two adjacent vertices. In this paper an infinite family of non-Cayley cubic 22-regular graphs of type 222^2 with a solvable automorphism group is constructed. The smallest graph in this family has order 6174.

Keywords

Cite

@article{arxiv.1607.02618,
  title  = {On cubic symmetric non-Cayley graphs with solvable automorphism groups},
  author = {Yan-Quan Feng and Klavdija Kutnar and Dragan Marusic and Da-Wei Yang},
  journal= {arXiv preprint arXiv:1607.02618},
  year   = {2016}
}

Comments

8 pages

R2 v1 2026-06-22T14:49:58.545Z