Science Fair Project Encyclopedia
Arc-transitive graph
In mathematics, an arc-transitive graph is a graph G such that, given any two edges e1 = u1v1 and e2 = u2v2 of G, there are two automorphisms
- f : G → G, g : G → G
such that
- f (e1) = e2, g (e1) = e2
and
- f (u1) = u2, f (v1) = v2,
- g (u1) = v2, g (v1) = u2.
In other words, a graph is arc-transitive if its automorphism group acts transitively upon its arcs.
10-26-2009 08:16:03
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