Abstract
A graph is called a Cayley graph (or bi-Cayley graph, respectively) of a group G if it has a group G of automorphisms acting semiregularly on the vertices with exactly one orbit (or two orbits, respectively). It is known every Cayley graph is vertex-transitive. In this paper, we first present a classification of connected cubic non-Cayley vertex-transitive bi-Cayley graphs of a finite p-group H, where p > 3 is a prime and the derived subgroup of H is either cyclic or isomorphic to Zp × Zp. This is then used to give a classification of connected cubic non-Cayley vertex-transitive graphs of order 2p4 for each prime p.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
