![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/3/32/BiggsSmith.svg/640px-BiggsSmith.svg.png&w=640&q=50)
Distance-transitive graph
Graph where any two nodes of equal distance are isomorphic / From Wikipedia, the free encyclopedia
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. Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and D. H. Smith.
![]() | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (September 2021) |
![](http://upload.wikimedia.org/wikipedia/commons/thumb/3/32/BiggsSmith.svg/320px-BiggsSmith.svg.png)
Quick Facts Graph families defined by their automorphisms, → ...
Close
A distance-transitive graph is interesting partly because it has a large automorphism group. Some interesting finite groups are the automorphism groups of distance-transitive graphs, especially of those whose diameter is 2.