The distinguishing index $D'(Γ)$ of a graph $Γ$ is the least number $k$ such that $Γ$ has an edge-coloring with $k$ colors preserved only by the trivial automorphism. In this paper we prove that if the automorphism group of a finite graph $Γ$ is simple, then its distinguishing index $D'(Γ)=2$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。