A distance-transitive graph is interesting partly because it has a large automorphism group.
The outer automorphism group is cyclic of order 2n + 1.
The full automorphism group of this hyperoval has order 3.
This automorphism group is infinite, but only finitely many of the automorphisms have the form given above.
M has index 2 in its automorphism group.
The group then acts as an automorphism group of the design.
The simply connected group has trivial center and outer automorphism group of order 2.
Every countable model of T has an oligomorphic automorphism group.
Later their automorphism groups led to exceptional groups such as G2.
It has an automorphism group of order 54 automorphisms.
