May be different for two isomorphic graphs.
可能是不同的两个同构的图。
After all the eigenvalues have been considered, isomorphism will be determined and correspondence of vertices in isomorphic graphs can be ultimately identified.
通过逐一考查全体特征值，实现图同构的判定并确定同构图的顶点对应关系。
The judgment principles and reduction rules about redundant nodes and isomorphic graphs are presented. The examples given show correctness and applicability of the algorithm.
阐述了算法的理论原理及计算步骤，并给出了冗余节点、子图同构的判断方法和简化规则算例验证了本理论的正确性和适应性。
应用推荐