Graph automorphism
= Graph automorphism
{wiki=Graph_automorphism}
Graph automorphism is a concept in graph theory that refers to a symmetry of a graph that preserves its structure. More specifically, an automorphism of a graph is a bijection (one-to-one and onto mapping) from the set of vertices of the graph to itself that preserves the adjacency relationship between vertices.