Automorphism — автоморфизм (ор)графа.
2. For a directed graph, automorphism is a permutation of such that the number of -edges is the same as the number of -edges . We also speak of the automorphism of a graph with colored edges. This means a permutation such that the number of -edges is the same as the number of -edges with any given color.
The set of all automorphisms of a (di)graph forms a permutation group .
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.