| 1. | We may thereby compute the number of graphs which are isomorphic to their complements .
因此我们可以计算同构于其补的图的数目。 |
| 2. | To show that two graphs are isomorphic one must indicate an isomorphism between them .
要证明两个图是同构的，就必须指出它们之间的一个同构。 |
| 3. | Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency .
如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。 |
| 4. | Isomorphic representations of cyclic groups and their direct product
循环群与循环群直积的同构表示 |
| 5. | A theoretical research about isomorphic words
同形词理论研究 |
| 6. | Prime number and two isomorphic group
与两个同构群 |
| 7. | The influence of awareness of isomorphic problems and students cognitive - style on geometry problem - solving transfer
认知风格对学生解题迁移的影响 |
| 8. | A graph g is called k1 , 4 - free graph if g does not contain an induced subgraph that is isomorphic to k1 , 4
所谓凡； 。 free图是指不含与k ， 。同构的导出子图的图 |
| 9. | Moreover , the smallest member x ( 3 , 3 ) of the family is isomorphic to the gray graph found in 1932
进一步的，这个族中的最小图x ( 3 ， 3 )同构于在1932年发现的gray图。 |
| 10. | Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency
如果在两个图之间存在一个保持邻接性的1 - 1对应，则这两个图是同构的。 |
