Automorphism groups of primitive distance-bitransitive graphs are almost simple
Automorphism groups of primitive distance-bitransitive graphs are almost simple
We apply a result of Praeger, Saxl and Yokoyama [4] concerning the automorphism groups of primitive distance-transitive graphs to primitive distance-bitransitive graphs. Imprimitive distance-bitransitive graphs are discussed in Section 2. One of the cases of the Praeger, Saxl and Yokayama Theorem is considered in Section 3 and the following main result is proved in Section 4.
187-197
Shawe-Taylor, J.
c32d0ee4-b422-491f-8c28-78663851d6db
April 1987
Shawe-Taylor, J.
c32d0ee4-b422-491f-8c28-78663851d6db
Shawe-Taylor, J.
(1987)
Automorphism groups of primitive distance-bitransitive graphs are almost simple.
European Journal of Combinatorics, 8 (2), .
(doi:10.1016/S0195-6698(87)80010-0).
Abstract
We apply a result of Praeger, Saxl and Yokoyama [4] concerning the automorphism groups of primitive distance-transitive graphs to primitive distance-bitransitive graphs. Imprimitive distance-bitransitive graphs are discussed in Section 2. One of the cases of the Praeger, Saxl and Yokayama Theorem is considered in Section 3 and the following main result is proved in Section 4.
Text
1-s2.0-S0195669887800100-main
- Version of Record
Available under License Other.
More information
Published date: April 1987
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 259851
URI: http://eprints.soton.ac.uk/id/eprint/259851
ISSN: 0195-6698
PURE UUID: aa824381-f6b4-4b0f-aa03-a2378844d863
Catalogue record
Date deposited: 27 Aug 2004
Last modified: 14 Mar 2024 06:29
Export record
Altmetrics
Contributors
Author:
J. Shawe-Taylor
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics