Distinguishing Index Of Graphs With Simple Automorphism Groups

EUROPEAN JOURNAL OF COMBINATORICS（2022）

引用 2|浏览5

暂无评分

摘要

The distinguishing index D'(Gamma) of a graph Gamma is the least number k such that Gamma 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 Gamma is simple, then its distinguishing index D'(Gamma) = 2. (C) 2021 Elsevier Ltd. All rights reserved.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要