In mathematics, a vertex-transitive Graph (mathematics) is a graph G such that, given any two vertices v1 and v2 of G , there is some Automorphism

: f : G → G

such that

: f ( v1 ) = v2.

In other words, a graph is vertex-transitive if its automorphism group acts Group action upon its vertices.

Every vertex-transitive graph is Regular graph.

= See also =