Vertex-transitive graph

Graph where all pairs of vertices are automorphic

In the mathematical field of graph theory, an automorphism is a permutation of the vertices such that edges are mapped to edges and non-edges are mapped to non-edges. A graph is a vertex-transitive graph if, given any two vertices v1 and v2 of G, there is an automorphism f such that

This keyword could refer to multiple things. Here are some suggestions: