In the mathematical field of graph theory, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an automorphism of G that maps e1 to e2.[1]
In other words, a graph is edge-transitive if its automorphism group acts transitively on its edges.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search