图的路径层矩阵与图的同构问题密切相关。
The path layer matrix is closely related to graph isomorphism.
本文讨论了两个可分图的张量乘积图的同构因子分解问题。
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.
提出了图的同构判定新算法，即关联度序列法和黄金分割关联度序列法。
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 novel method, the circuit simulation algorithm, is proposed here, which transfers the graph isomorphism problem into the identical circuits problem.
并根据简单图的同构判定理论，提出了基于混合支路数学模型的同构混合开关拓扑辨识方法。
A method of identifying isomorphic hybrid switching topology based on mathematical model of hybrid branch is proposed.
图1显示了用于组织不同构造的文件夹。
Figure 1 shows folders that are used to organize different constructs.
要证明两个图是同构的，就必须指出它们之间的一个同构。
To show that two graphs are isomorphic one must indicate an isomorphism between them.
可能是不同的两个同构的图。
返回到轴线的结构分解图，一旦群体被建立，分解不同构件的渲染图是不用花费多少时间的。
Back to the exploded axon, once the groups are established, exploding the geometry for the illustration takes no time at all.
最能形象地说明道教以身体为核心，使得个人、社会与自然具有同构关系的是《内经图》。
Picture of Inner Scripture can best reflect that the Daoism makes the individual, the society and the nature have the same construction relation with the body as the centre.
泳池俯瞰图。泳池边的木甲板和植物与池水无缝连接，共同构成了独特的水景。
The Pool from above. A series of wood decks and planters seamlessly integrate with the water. Together they combine into one unique piece of aqua-landscape.
在同构意义下， 几个顶点的完全图只有一个。
Up to isomorphism, there is just one complete graph on vertices.
判断图同构的一种有用的方法是对图的邻接矩阵进行初等变换，变成另一个图的邻接矩阵。
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.
因此我们可以计算同构于其补的图的数目。
We may thereby compute the number of graphs which are isomorphic to their complements.
本文所研究的具有相同路径层矩阵不同构的图的问题是在药品分析的实际应用领域中提出来的。
The subject of graphs having the same path layer matrix, which we are researching, arises from the drug design.
纠正了关于赋值图的张量代数的同构定理证明中的一个疏忽，给出了此同构定理一个完整的证明。
An error is corrected and a complete proof of isomorphism theorem for tensor algebras over valued graphs is given.
指出了瞬心速度图与瞬心图的动态同构关系。
The dynamic isomorphic relations between instant center velocity chart and instant center chart are indicated as well.
如果在两个图之间存在一个保持邻接性的1 - 1对应，则这两个图是同构的。
Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency.
其次，将频繁子图边扩展及同构判断这部分频繁子图挖掘算法中时间复杂度最高的部分并行处理。
Secondly, we processed the edge expansion and frequent sub-graph isomorphism which are the most complexity parts of frequent subgraphs mining in parallel.
一个图称为点传递图，如果它的全自同构群在它的顶点集合上作用传递。
Firstly, we obtain some equivalent characterization for Cayley graphs of completely simple semigroup which is vertex-transitive.
在这个假定下，我们进一步根据商有向图及核K为C（G，S）的自同构群刻划出了一系列特性。
Under this assumption, the present paper further gives a characterization for the automorphism group of C( G, S) in terms of the quotient di-graph and the kernel K.
在这个假定下，我们进一步根据商有向图及核K为C（G，S）的自同构群刻划出了一系列特性。
Under this assumption, the present paper further gives a characterization for the automorphism group of C( G, S) in terms of the quotient di-graph and the kernel K.
应用推荐