A graph is __vertexโtransitive__ if its automorphism group acts transitively on vertices of the graph. A vertexโtransitive graph is a __Cayley graph__ if its automorphism group contains a subgroup acting regularly on its vertices. In this article, the tetravalent vertexโtransitive nonโCayley graphs
VERTEX-TRANSITIVE GRAPHS OF ORDER 2p
โ Scribed by Brian Alspach; Richard J. Sutcliffe
- Book ID
- 118717633
- Publisher
- John Wiley and Sons
- Year
- 1979
- Tongue
- English
- Weight
- 597 KB
- Volume
- 319
- Category
- Article
- ISSN
- 0890-6564
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1 / โ S and S = {s -1 | s โ S}. The Cayley graph Cay(G, S) on G with respect to S
In 1983, D. Maru~ifi initiated the determination of the set NC of non-Cayley numbers. A number n belongs to NC if there exists a vertex-transitive, non-Cayley graph of order n. The status of all non-square-free numbers and the case when n is the product of two primes was settled recently by B.D. McK