Distance-Transitivity in Infinite Graphs
โ Scribed by R.G. Moller
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 178 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
โฆ Synopsis
We give a positive answer to a question of Thomassen and Woess; we prove that for an infinite locally finite connected graph with more than one end 2-distancetransitivity implies distance-transitivity.
1994 Academic Press, Iะปc.
๐ SIMILAR VOLUMES
A distance-transitive antipodal cover of a complete graph K n possesses an automorphism group that acts 2-transitively on the fibres. The classification of finite simple groups implies a classification of finite 2-transitive permutation groups, and this allows us to determine all possibilities for s
This paper is a contribution to the programme to classify finite distance-transitive graphs and their automorphism groups. We classify pairs ( , G) where is a graph and G is an automorphism group of acting distance-transitively and primitively on the vertex set of , subject to the condition that the
We classify the affine distance-transitive graphs with the property that the stabilizer of a vertex is a cross characteristically embedded group of Lie type.
This paper completes the classification of antipodal distance-transitive covers of the complete bipartite graphs K k , k , where k ั 3 . For such a cover the antipodal blocks must have size r ั k . Although the case r ฯญ k has already been considered , we give a unified treatment of r ั k . We use d