Jump to content

Vertex-transitive graph

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 24.2.209.115 (talk) at 01:53, 7 April 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A graph G is vertex-transitive if, given any two vertices v1 and v2 of G, there is some automorphism f : GG such that f ( v1 ) = v2. In other words, a graph is vertex-transitive if its automorphism group acts transitively upon its vertices.

Note that every vertex-transitive is regular