The Distinguishing Index of Infinite Graphs

Electronic Journal Of Combinatorics

Izak Broere¹ 

关键词: distinguishing index;    automorphism;    infinite graph;    countable graph;    edge colouring;    Infinite Motion Lemma;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The  distinguishing index $D^\prime(G)$ of a graph $G$ is the least cardinal $d$ such that $G$ has an edge colouring with $d$ colours that is only preserved by the trivial automorphism. This is similar to the notion of the distinguishing number $D(G)$ of

【 授权许可】

Others