Edge-transitive graph

In the mathematical field of graph theory, an edge-transitive graph is a graph $G$ such that, given any two edges $e 1$ and $e 2$ of $G$ , there is an automorphism of $G$ that maps $e 1$ to $e 2$ .

In other words, a graph is edge-transitive if its automorphism group acts transitively on its edges.