论文标题
区分简单的组
Distinguishing simple groups
论文作者
论文摘要
图$γ$的区分数字$ d（γ）$是$γ$的顶点的分区的最小尺寸，因此没有$γ$的非平凡的自动形态保留此分区。我们表明，如果图$γ$的自动形态组简单，那么$ d（γ）= 2 $。这是通过建立简单组的所有可能动作的区分数来获得的。
The distinguishing number $D(Γ)$ of a graph $Γ$ is the least size of a partition of the vertices of $Γ$ such that no non-trivial automorphism of $Γ$ preserves this partition. We show that if the automorphism group of a graph $Γ$ is simple, than $D(Γ)=2$. This is obtained by establishing the distinguishing number for all possible actions of simple groups.
