Distance-transitive graph
（重定向自Distance transitive graph）
![The Biggs-Smith graph, the largest 3-regular distance-transitive graph.](/Images/godic/202501/09/BiggsSmith.svg2154.png")
In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y.