| 1. | In other words it has a large automorphism group .
换言之，它有大的自同构群。 |
| 2. | There are various so-called "canonical isomorphisms" .
有各种各样的所谓“典范同构”。 |
| 3. | Up to isomorphism, there is just one complete graph on vertices .
在同构意义下，几个顶点的完全图只有一个。 |
| 4. | We may thereby compute the number of graphs which are isomorphic to their complements .
因此我们可以计算同构于其补的图的数目。 |
| 5. | To show that two graphs are isomorphic one must indicate an isomorphism between them .
要证明两个图是同构的，就必须指出它们之间的一个同构。 |
| 6. | Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency .
如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。 |
| 7. | We shall use algebraic methods to study graphs which are highly regular although this regularity is not expressed in terms of the automorphism group .
我们将用代数方法来研究高度正则的图，尽管这种正则性不是用自同构群来表达的。 |
| 8. | The orders of automorphism groups of two families of p - group
群族的自同构群的阶 |
| 9. | A note on the groups that are automorphism groups
充当自同构群的有限群的几点注记 |
| 10. | They might be heterogeneous or homogeneous
它们可能是同构的，也可能是异构的。 |
