 Distance-transitive graph

An automorphism group is transitive on ordered pairs of vertices at every fixed distance. Grassmann graphs provide examples with the finite general linear group as a distance-transitive automorphism group.

A distance-transitive graph is a type of graph that exhibits a high degree of symmetry with respect to the distances between vertices.