Buy Me a Coffee at ko-fi.com

Distance-transitive graph

graph where any two nodes of equal distance are isomorphic

Pronunciation
/ˈdɪstəns - ˈtranzɪtɪv ɡrɑːf/
/ˈdɪstəns - ˈtrænsədɪv ɡræf/