In mathematics, an edge-transitive Graph (mathematics) is a graph G such that, given any two edges e1 and e2 of G , there is some Automorphism

: f : G → G

such that

: f ( e1 ) = e2.

In other words, a graph is edge-transitive if its automorphism group (mathematics) acts group action upon its edges.

=Examples and properties=

= See also =