Applied Theory of Coding, Automata and Graphs

On a new complete invariant for acyclic graphs

A. V. Prolubnikov

Omsk State University, Omsk

Abstract: A new complete invariant for acyclic graphs is presented. An algorithm for solution of the graph isomorphism problem is considered. The algorithm is based on the invariant and gives solution of the problem for a wide graph class.

UDC: 519.175.1