Edge-transitive bi-Cayley graphs
Abstract
A graph admitting a group of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over . Such a graph is called {\em normal\/} if is normal in the full automorphism group of , and {\em normal edge-transitive\/} if the normaliser of in the full automorphism group of is transitive on the edges of . % In this paper, we give a characterisation of normal edge-transitive bi-Cayley graphs, %which form an important subfamily of bi-Cayley graphs, and in particular, we give a detailed description of -arc-transitive normal bi-Cayley graphs. Using this, we investigate three classes of bi-Cayley graphs, namely those over abelian groups, dihedral groups and metacyclic -groups. We find that under certain conditions, `normal edge-transitive' is the same as `normal' for graphs in these three classes. As a by-product, we obtain a complete classification of all connected trivalent edge-transitive graphs of girth at most , and answer some open questions from the literature about -arc-transitive, half-arc-transitive and semisymmetric graphs.
Cite
@article{arxiv.1606.04625,
title = {Edge-transitive bi-Cayley graphs},
author = {Marston Conder and Jin-Xin Zhou and Yan-Quan Feng and Mi-Mi Zhang},
journal= {arXiv preprint arXiv:1606.04625},
year = {2016}
}