TY - JOUR
T1 - 6-Transitive graphs
AU - Cameron, Peter J.
PY - 1980/1/1
Y1 - 1980/1/1
N2 - 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 6-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 5- but not 6-transitive.
AB - 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 6-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 5- but not 6-transitive.
UR - http://www.scopus.com/inward/record.url?scp=0001127993&partnerID=8YFLogxK
U2 - 10.1016/0095-8956(80)90063-5
DO - 10.1016/0095-8956(80)90063-5
M3 - Article
AN - SCOPUS:0001127993
SN - 0095-8956
VL - 28
SP - 168
EP - 179
JO - Journal of Combinatorial Theory, Series B
JF - Journal of Combinatorial Theory, Series B
IS - 2
ER -