Cubic edge-transitive bi-Cayley graphs over inner-abelian p-groups
Combinatorics
2017-01-05 v1
Abstract
A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. A non-abelian group is called an inner-abelian group if all of its proper subgroups are abelian. In this paper, we complete the classification of connected cubic edge-transitive bi-Cayley graphs over inner-abelian p-groups for an odd prime p.
Cite
@article{arxiv.1701.00908,
title = {Cubic edge-transitive bi-Cayley graphs over inner-abelian p-groups},
author = {Yan-Li Qin and Jin-Xin Zhou},
journal= {arXiv preprint arXiv:1701.00908},
year = {2017}
}
Comments
13 pages. arXiv admin note: text overlap with arXiv:1610.07307