The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co
On Finite s-Transitive Graphs of Odd Order
โ Scribed by Cai Heng Li
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 128 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
โฆ Synopsis
It is shown that, for a positive integer s, there exists an s-transitive graph of odd order if and only if s 3 and that, for s=2 or 3, an s-transitive graph of odd order is a normal cover of a graph for which there is an automorphism group that is almost simple and s-transitive.
๐ 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
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
Let be a projective plane of odd order n containing an oval โ. We give a classification of collineation groups of which fix โ and act transitively on the set I I of all internal points of โ.
Alspach has conjectured that any 2k-regular connected Cayley graph cay(A, S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S=[s 1 , s 2 , ..., s k ] is a minimal generating set of an abelian group A of odd order (where a