Cubic vertex-transitive non-Cayley graphs of order 12p
Combinatorics
2017-05-15 v1 Group Theory
Abstract
A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic vertex-transitive non-Cayley graphs of order , where is a prime, is given. As a result, there are sporadic and one infinite family of such graphs, of which the sporadic ones occur when , or , and the infinite family exists if and only if , and in this family there is a unique graph for a given order.
Keywords
Cite
@article{arxiv.1705.04551,
title = {Cubic vertex-transitive non-Cayley graphs of order 12p},
author = {Wei-Juan Zhang and Yan-Quan Feng and Jin-Xin Zhou},
journal= {arXiv preprint arXiv:1705.04551},
year = {2017}
}
Comments
This paper has been accepted for publication in SCIENCE CHINA Mathematics