How to determine the isomorphism of graphs is a difficult problem of graph theory, which has not been completely solved so far.
图同构的判定性问题是图论理论中的一个难题，至今没有得到彻底解决。
One helpful way to determine the isomorphism of graphs is to use elementary operations on a graph adjacency matrix so as to transform one matrix into another.
判断图同构的一种有用的方法是对图的邻接矩阵进行初等变换，变成另一个图的邻接矩阵。
After all the eigenvalues have been considered, isomorphism will be determined and correspondence of vertices in isomorphic graphs can be ultimately identified.
通过逐一考查全体特征值，实现图同构的判定并确定同构图的顶点对应关系。
An error is corrected and a complete proof of isomorphism theorem for tensor algebras over valued graphs is given.
纠正了关于赋值图的张量代数的同构定理证明中的一个疏忽，给出了此同构定理一个完整的证明。
A new isomorphism testing algorithm for graphs is presented, which consists of incidence degree sequence method and improved golden section incidence degree sequence method.
提出了图的同构判定新算法，即关联度序列法和黄金分割关联度序列法。
A new isomorphism testing algorithm for graphs is presented, which consists of incidence degree sequence method and improved golden section incidence degree sequence method.
提出了图的同构判定新算法，即关联度序列法和黄金分割关联度序列法。
应用推荐