Abstract

A graph is said to be a bi-Cayley graph over a group H if there exists a subgroup of Aut(G) isomorphic to H acting semiregularly on its vertex set with two orbits. In this paper, we give a complete classification of connected cubic vertex-transitive bi-Cayley graphs over semidihedral group. As a byproduct, we construct a family of vertex-transitive non-Cayley graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call