| 1. | To show that two graphs are isomorphic one must indicate an isomorphism between them .
要证明两个图是同构的，就必须指出它们之间的一个同构。 |
| 2. | Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency .
如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。 |
| 3. | They might be heterogeneous or homogeneous
它们可能是同构的，也可能是异构的。 |
| 4. | A note on the isomorphisms of the semidirect product
关于半直积同构的一点注记 |
| 5. | Discussion on the isomorphism of the semidirect product
关于半直积同构的讨论 |
| 6. | Notes on the isomorphism of the semidirect product
关于半直积同构的注记 |
| 7. | Characteirzations of nest algebra automorphisms
套代数上自同构的刻画 |
| 8. | Relational data is regular and homogeneous
关系数据是规则且同构的。 |
| 9. | A new approach for distinguishing isomorphism of kinematic chains
一种判定运动链同构的新方法 |
| 10. | Decision of pm - order abel p - group isomorphism
群同构的判定 |
