Highly Influential

4 Excerpts

- Published 1980 in J. Comb. Theory, Ser. B

A connected graph is n-transitive if, whenever two n-tuples are isometric, there is an automorphism mapping the first to the second. It is shown that a B-transitive graph is complete multipartite, or complete bipartite with a matching deleted, or a cycle, or one of three special graphs on 9, 12 and 20 vertices. These graphs are n-transitive for all n; but there are graphs (the smallest on 56 vertices) which are 5but not 64ransitive.

@article{Cameron19806TransitiveG,
title={6-Transitive graphs},
author={Peter J. Cameron},
journal={J. Comb. Theory, Ser. B},
year={1980},
volume={28},
pages={168-179}
}