Edge-transitive bi-Cayley graphs

From MaRDI portal
Publication:2200924

DOI10.1016/J.JCTB.2020.05.006zbMATH Open1448.05098arXiv1606.04625OpenAlexW3035037184MaRDI QIDQ2200924FDOQ2200924


Authors: Jin-Xin Zhou, Marston D. E. Conder, Yan-Quan Feng, Mimi Zhang Edit this on Wikidata


Publication date: 24 September 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/1606.04625




Recommendations




Cites Work


Cited In (38)

Uses Software





This page was built for publication: Edge-transitive bi-Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200924)