期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2019
卷号：16
期号：3
页码：280-283
DOI：10.1016/j.akcej.2018.02.001
语种：English
出版社：Elsevier
摘要：AbstractThe 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.
