Distinguishing number and distinguishing index of certain graphs
Combinatorics
2016-07-27 v2
Abstract
The distinguishing number (index) () of a graph is the least integer such that has an vertex labeling (edge labeling) with 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.
Keywords
Cite
@article{arxiv.1602.03302,
title = {Distinguishing number and distinguishing index of certain graphs},
author = {Saeid Alikhani and Samaneh Soltani},
journal= {arXiv preprint arXiv:1602.03302},
year = {2016}
}
Comments
15 pages, 6 figures....To appear in FILOMAT