Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs

Sergey Kurapov, Maxim Davidovsky

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency…