Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653635 | European Journal of Combinatorics | 2014 | 15 Pages |
Abstract
A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits of equal size. In this paper, some basic properties and the automorphisms of bi-Cayley graphs are explored. As an application, a classification of connected cubic vertex-transitive bi-Cayley graphs over abelian groups is given, and using this, a problem posed in Zhou and Feng (2012) regarding the Cayley property of a class of graphs is solved.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jin-Xin Zhou, Yan-Quan Feng,