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.
阐述了算法的理论原理及计算步骤，并给出了冗余节点、子图同构的判断方法和简化规则算例验证了本理论的正确性和适应性。
To show that two graphs are isomorphic one must indicate an isomorphism between them.
要证明两个图是同构的，就必须指出它们之间的一个同构。
Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency.
如果在两个图之间存在一个保持邻接性的1 - 1对应，则这两个图是同构的。
In this paper, we discuss isomorphic factorization for tensor product of two divisible graphs and prove the conditions for the tensor product graphs to be factorized isomorphically.
本文讨论了两个可分图的张量乘积图的同构因子分解问题。
We may thereby compute the number of graphs which are isomorphic to their complements.
因此我们可以计算同构于其补的图的数目。
We may thereby compute the number of graphs which are isomorphic to their complements.
因此我们可以计算同构于其补的图的数目。
应用推荐