English

Edge-transitive bi-Cayley graphs

Combinatorics 2016-06-16 v1

Abstract

A graph \G\G admitting a group HH of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over HH. Such a graph \G\G is called {\em normal\/} if HH is normal in the full automorphism group of \G\G, and {\em normal edge-transitive\/} if the normaliser of HH in the full automorphism group of \G\G is transitive on the edges of \G\G. % 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 22-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 pp-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 66, and answer some open questions from the literature about 22-arc-transitive, half-arc-transitive and semisymmetric graphs.

Keywords

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}
}
R2 v1 2026-06-22T14:25:37.732Z