Trees with distinguishing number two

摘要

The distinguishing numberD(G)of a graphGis the least integerdsuch thatGhas a vertex labeling withdlabels 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.