๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Locally s-distance transitive graphs

โœ Scribed by Alice Devillers; Michael Giudici; Cai Heng Li; Cheryl E. Praeger


Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
204 KB
Volume
69
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Antipodal Distance Transitive Covers of
โœ C.D. Godsil; R.A. Liebler; C.E. Praeger ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 352 KB

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

Affine Distance-transitive Graphs with S
โœ J. van Bon; A.A. Ivanov; J. Saxl ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 215 KB

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

On bounded automorphisms of locally fini
โœ Niemeyer, Peter ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 517 KB

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

Affine Distance-transitive Graphs: the C
โœ Arjeh M. Cohen; Kay Magaard; Sergey Shpectorov ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 352 KB

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.

Antipodal Distance-transitive Covers of
โœ A.A. Ivanov; Robert A. Liebler; Tim Penttila; Cheryl E. Praeger ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 480 KB

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

Distance-Transitivity in Infinite Graphs
โœ R.G. Moller ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 178 KB

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.