Graph Theory, Isomorphism, Mathematics, Python, Discrete Mathematics.
transforms a permutation into cycle notation format: Automorphisms An automorphism from a graph G is an isomorphism to itself. Formally, an automorphism of G is a permutation such that the pair of vertices (u, v) form an edge if an only the pair (σ(u), σ(v)) also form an edge. The number of