Solution for the problem of graph structure invariant description

The problem of the invariant description of the graph structure is solved by the vertices differentiation method and by forming on its basis integral graph descriptor (ISD). The process of the differentiation is described as functioning of the developed dynamic system, which has a graph model represented as an automata network. Algorithms for controlling the process of the differentiation when calculating complete invariant with free (ISD-F), dependent (ISD-D) and independent (ISD-I) integration of codes of structural differences are developed. Studied appliance features of algorithms of the graph isomorphism verification, calculating complete invariant and evaluating structures similarity based on interdependent codes integration (ISD-ID). GraphISD program were developed to carry out tests. Results showed high effectiveness of the algorithms.