## Abstract In 1983, the second author [D. Marušič, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers __n__ there exists a non‐Cayley vertex‐transitive graph on __n__ vertices. (The term __non‐Cayley numbers__ has later been given to such integers.) Motivated by this problem,
Vertex-transitive graphs that are not Cayley graphs. II
✍ Scribed by McKay, Brendan D.; Praeger, Cheryl E.
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 881 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
The Petersen graph on 10 vertices is the smallest example of a vertex-transitive graph that is not a Cayley graph. In 1983, D. MaruSiE asked, "For what values of n does there exist such a graph on n vertices?" We give several new constructions of families of vertex-transitive graphs that are not Cayley graphs and complete the proof that, if n is divisible byp2 for some primep, then there is a vertex-transitive graph on n vertices that is not a Cayley graph unless n is p 2 , p 3 , or 12.
📜 SIMILAR VOLUMES
## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra
The aim of this note is to present a short proof of a result of Nedela and S8 koviera (J. Graph Theory 19 (1995, 1 11)) concerning those generalized Petersen graphs that are also Cayley graphs. In that paper the authors chose the heavy weaponry of regular maps on closed connected orientable surfaces
This paper completes the determination of all integers of the form pqr (where p, q, and r are distinct primes) for which there exists a vertex-transitive graph on pqr vertices which is not a Cayley graph.
## Abstract Let __n__ be an integer and __q__ be a prime power. Then for any 3 ≤ __n__ ≤ __q__−1, or __n__=2 and __q__ odd, we construct a connected __q__‐regular edge‐but not vertex‐transitive graph of order 2__q__^__n__+1^. This graph is defined via a system of equations over the finite field of