6-Transitive graphs

Peter J. Cameron*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

30 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)168-179
Number of pages12
JournalJournal of Combinatorial Theory, Series B
Issue number2
Publication statusPublished - 1 Jan 1980


Dive into the research topics of '6-Transitive graphs'. Together they form a unique fingerprint.

Cite this