|
|
|
|
|
Vertex-transitive GraphIn 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
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|