Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency . 如果在两个图之间存在一个保持邻接性的1-1对应,则这两个图是同构的。
We shall use algebraic methods to study graphs which are highly regular although this regularity is not expressed in terms of the automorphism group . 我们将用代数方法来研究高度正则的图,尽管这种正则性不是用自同构群来表达的。
The orders of automorphism groups of two families of p - group 群族的自同构群的阶
A note on the groups that are automorphism groups 充当自同构群的有限群的几点注记
They might be heterogeneous or homogeneous 它们可能是同构的,也可能是异构的。