Vertex-transitive graph

This article defines a property that can be evaluated to true/false for any undirected graph, and is invariant under graph isomorphism. Note that the term "undirected graph" as used here does not allow for loops or parallel edges, so there can be at most one edge between two distinct vertices, the edge is completely described by the vertices it joins, and there can be no edge from a vertex to itself.
View other such properties

Definition

An undirected graph is termed a vertex-transitive graph if its automorphism group acts transitively on its vertex set. By convention, we may assume that the graph with no vertices is vertex-transitive, though it's better to avoid using the term for such graphs.