Vertex-transitive graph
= Vertex-transitive graph
A <graph> whose automorphisms act transitively on its vertices: any chosen <vertex of a graph> can be carried to any other by a symmetry preserving adjacency. Consequently rooted <self-avoiding walk> counts are independent of the chosen root.