Skip to Main Content
An algorithm is presented to test the graph isomorphism for undirected linear graphs. The graph isomorphism between two or more graphs can be tested by obtaining their optimum codes. The algorithm relabels the nodes of graphs to obtain optimum codes. The optimum code is the code of maximum weight obtained from the upper triangle of the Adjacency matrix of the given graph. The method of ordering the nodes of a graph to produce a code invariant to isomorphism is related to invariant features in feature extraction , .