Distance-transitive graphs

Research output: Chapter in Book/Report/Conference proceedingChapterProfessional

Abstract

In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite simple groups, it seems possible to find all distance-transitive graphs. Priority is given to the classification of the so-called primitive ones. We give all account of the achievements in this direction.
Original languageEnglish
Title of host publicationTopics in Algebraic Graph Theory
EditorsL.W. Beineke, R.J. Wilson, P.J. Cameron
Place of PublicationCambridge
PublisherCambridge University Press
Pages222-249
Number of pages290
ISBN (Print)0-52180197-4
Publication statusPublished - 2004

Publication series

NameEncyclopedia of Mathematics and its Applications
Volume102

Fingerprint Dive into the research topics of 'Distance-transitive graphs'. Together they form a unique fingerprint.

Cite this