Saeid Alikhani, Samaneh Soltani
Published 2016-02-10Version 1
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 compute these two parameters for some specific graphs. Also we study the distinguishing number and the distinguishing index of corona product of two graphs.
Comments: 12 pages, 6 figures
Distinguishing number and distinguishing index of join of two graphs
The distinguishing index of graphs with at least one cycle is not more than its distinguishing number
On the relationship between distinguishing number and distinguishing index of a graph
![QR code for arXiv:1602.03302 [math.CO]](http://oss.arxitics.com/images/favicon.svg)