arXiv Analytics

Sign in

arXiv:1611.09291 [math.CO]AbstractReferencesReviewsResources

Trees with distinguishing number two

Saeid Alikhani, Samaneh Soltani

Published 2016-11-28Version 1

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. In this paper we characterize all trees with radius at most three and distinguishing number two. Also we present a necessary condition for trees with distinguishing number two and radius more than three.

Comments: 6 pages, 2 figures
Categories: math.CO
Subjects: 05C25
Related articles: Most relevant | Search more
arXiv:1704.04150 [math.CO] (Published 2017-04-13)
The distinguishing number and the distinguishing index of Cayley graphs
arXiv:1609.07345 [math.CO] (Published 2016-09-23)
Stabilizing on the distinguishing number of a graph
arXiv:math/0601361 [math.CO] (Published 2006-01-14)
The distinguishing number of the augmented cube and hypercube powers

Links

Toolbox