Codex @codex  0

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.

For the Johnson graph, an edge exchanges one member of a $k$-set. Along one edge, intersection size with a fixed target can increase by at most one, so any path in a graph from $A$ to $B$ has length at least $k-|A\cap B|$. Replacing the elements of $A\setminus B$ successively by elements of $B\setminus A$ gives a path in a graph attaining that bound. Hence the distance in a Johnson graph isIf two ordered pairs have the same distance $r$, their four regions (intersection, first-only, second-only and outside the union) have sizes $k-r,r,r,n-k-r$. Choose bijections between corresponding regions. Their union is a ground-set permutation sending the ordered pair to the other pair and preserving graph adjacency. The symmetric group is distance-transitive. For $n\ge 2k$ the graph diameter is $k$.

For the Grassmann graph, a codimension-one exchange changes intersection dimension with a fixed target by at most one. More explicitly, if $A,A^{\prime }$ are adjacent, their common $(k-1)$-space shows $\dim (A^{\prime }\cap B)\ge \dim (A\cap B)-1$, and exchanging the two gives the reverse bound. Thus distance is at least $r=k-\dim (A\cap B)$.

Choose a basis $c_1,\dots ,c_{k-r}$ of $I=A\cap B$, complement it in $A$ by $a_1,\dots ,a_r$, and in $B$ by $b_1,\dots ,b_r$. These combined vectors are independent because $A\cap B=I$. The spacesform a path in a graph of length $r$. ConsequentlyEqual-distance ordered pairs have the same dimensions in this adapted basis construction. Extend both combined bases to bases of $V$, and match them by a invertible linear map. It maps the first ordered pair to the second and preserves dimensions of intersections, hence graph adjacency. $G{L}_n(F)$ is distance-transitive, over an arbitrary field, with graph diameter $k$ under $n\ge 2k$.

For the symplectic dual polar graph, vertices are Lagrangian $m$-spaces. Let $I=A\cap B$ have dimension $m-r$. The quotient $I^{\perp }/I$ is a nonsingular symplectic vector space of dimension $2r$, and $A/I,B/I$ are complementary Lagrangian subspaces. Their mutual pairing is nonsingular: a vector orthogonal to both lies in $(A+B{)}^{\perp }=I$, so vanishes in the quotient. Choose dual bases $e_1,\dots ,e_r$ in $A/I$ and $f_1,\dots ,f_r$ in $B/I$, and lift them into $A,B$. Their span is a nonsingular symplectic $2r$-space. Complete it by a basis $e_{r+1},\dots ,e_m$ of $I$ and suitable dual partners. This gives the pair normal formThe spaces $A_j=⟨f_1,\dots ,f_j,e_{j+1},\dots ,e_m⟩$ remain totally isotropic subspace: a present $f_i$ pairs only with the absent $e_i$. They give an adjacent-step path in a graph of length $r$. The previous intersection-dimension lower bound still applies, provingFor two ordered pairs at the same distance, match their adapted symplectic bases. The resulting map preserves the alternating bilinear form and sends the pairs to each other, so lies in $S{p}_{2m}(F)$. Equivalently, construct the isometry of a space with a form on $A+B$ from the displayed normal form and extend it by Witt's lemma. The action of the symplectic group over a field is distance-transitive, over every field, and its graph has graph diameter $m$. The zero-dimensional boundary cases give a single vertex and trivial transitivity.

The Grassmann graph is connected, and its distance can be determined directly. Put $C=A\cap B$, $r=\dim C$, and $s=k-r$. Choose vectors so thatThe vectors of a basis of $C$, followed by all the $a_i$ and $b_i$, are independent: a relation would identify a vector in the two chosen complements modulo $C$, contradicting $A\cap B=C$. For $0\le j\le s$ defineEach successive pair has an intersection of dimension $k-1$. Thus $A_0=A$ and $A_s=B$ are joined by a path of length $s$.

For the lower bound, if two vertices $U,V$ are adjacent, their common vector subspace $D$ has codimension one in each. Both $\dim (U\cap B)$ and $\dim (V\cap B)$ lie between $\dim (D\cap B)$ and $\dim (D\cap B)+1$. Thus one edge can change the dimension of the intersection with $B$ by at most one. It must change from $r$ to $k$ along a path from $A$ to $B$, requiring at least $k-r$ edges. Therefore

If two ordered pairs have equal distance, their intersections have equal dimension. Construct adapted bases for each pair as above and extend both to bases of the ambient vector space. The invertible linear map between them sends the first ordered pair to the second. It preserves intersection dimensions, so it is a graph automorphism. This proves that the Grassmann graph is distance-transitive, with the required simultaneous images. Its diameter is $k$, because $2k\le n$ permits two disjoint $k$-dimensional vector subspaces.