An edge automorphism of a graph 
is a permutation of the edges of 
that sends edges with common endpoint into edges with a common
endpoint. The set of all edge automorphisms of 
from a group called the edge
automorphism group of 
, denoted 
.
Edge Automorphism
See also
Edge Automorphism Group, Edge-Transitive Graph, Graph AutomorphismExplore with Wolfram|Alpha
References
Holton, D. A. and Sheehan, J. The Petersen Graph. Cambridge, England: Cambridge University Press, p. 25, 1993.Referenced on Wolfram|Alpha
Edge AutomorphismCite this as:
Weisstein, Eric W. "Edge Automorphism." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/EdgeAutomorphism.html