Definitions from Wikipedia (Distance-transitive graph)

▸ noun:  In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices and at any distance , and any other two vertices and at the same distance, there is an automorphism of the graph that carries to and to .


▸ Words similar to distance-transitive graph
▸ Usage examples for distance-transitive graph

▸ Idioms related to distance-transitive graph
▸ Wikipedia articles (New!)
▸ Words that often appear near distance-transitive graph
▸ Rhymes of distance-transitive graph

▸ Invented words related to distance-transitive graph