Science Fair Project Encyclopedia
Vertex-transitive graph
In mathematics, a vertex-transitive graph 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 transitively upon its vertices.
Every vertex-transitive graph is regular
See also
12-03-2008 10:22:39
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details