| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653443 | European Journal of Combinatorics | 2015 | 6 Pages |
Abstract
The concept of generalized Cayley graphs was introduced by MaruÅ¡iÄ et al. (1992), where it was asked if there exists a vertex-transitive generalized Cayley graph which is not a Cayley graph. In this paper the question is answered in the affirmative with a construction of two infinite families of such graphs. It is also proven that every generalized Cayley graph admits a semiregular automorphism.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ademir HujduroviÄ, Klavdija Kutnar, Dragan MaruÅ¡iÄ,
