Topological code of graphs (Q1188076)

The aim of this paper is to associate a numerical code to a finite, symmetric, nonreflexive graph, used to identify isomorphic graphs. One starts with the adjacency matrix of the graph, then relabels the vertices by a standard procedure. What is here meant by topological code is this new adjacency matrix, used to identify the isomorphism class of the graph. An interactive program based on these steps is described, but the lack of details makes difficult any efficiency judgement.