2000 character limit reached
The distinguishing number and the distinguishing index of Cayley graphs (1704.04150v1)
Published 13 Apr 2017 in math.CO
Abstract: The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. In this paper, we investigate the distinguishing number and the distinguishing index of Cayley graphs.