Edge-transitive bi-Cayley graphs (Q2200924)

A graph \(\Gamma\) is a bi-Cayley graph on the group \(G\) if there is a subgroup of the automorphism group of \(\Gamma\) that is isomorphic to \(G\) and acts semi-regularly, with two orbits (of equal length). In this paper, the authors consider bi-Cayley graphs that are edge-transitive. They produce a variety of important and interesting results about such graphs, including: \par i) showing that the normaliser of \(G\) in the automorphism group of \(\Gamma\) cannot act transitively on the 3-arcs of \(\Gamma\), and characterising when it can act transitively on the 2-arcs; and \par ii) demonstrating with infinite families in each case that when the normaliser of \(G\) in the automorphism group of \(\Gamma\) acts transitively on the edges, \(\Gamma\) can be arc-transitive, half-arc-transitive, or semisymmetric. \par They also provide constructions and structural results about semisymmetric bi-Cayley graphs on dihedral groups and bi-Cayley graphs of valency 4 on non-abelian metacyclic \(p\)-groups, that are vertex-transitive and edge-transitive. \par This work also allows the authors to completely characterise connected edge-transitive graphs of valency 3 and girth at most 6.