After all the eigenvalues have been considered, isomorphism will be determined and correspondence of vertices in isomorphicgraphs can be ultimately identified.
通过逐一考查全体特征值，实现图同构的判定并确定同构图的顶点对应关系。
3
The judgment principles and reduction rules about redundant nodes and isomorphicgraphs are presented. The examples given show correctness and applicability of the algorithm.