# Automorphism group of edge symmetry

I asked a similar question before,

https://ask.sagemath.org/question/427...

I am curious that is there any similar function for finding "edge symmetry"?

Note: the link I provided is for "node symmetry" in a network (graph).

Can you clarify what you mean by an example? Do you mean the set of permutations of (labeled) edges induced by permutations of vertices?