Assertion: graph's automorphism | /r/HasProperty | permutation
Facets:
value: formally
type: MANNER
Source sentences:
text: Formally, an automorphism of a graph G = (V,E) is a permutation σ of the vertex set V, such that the pair of vertices (u,v) form an edge if and only if the pair (σ(u),σ(v)) also form an edge.