Trees with distinguishing number two (Q2176156)

A labeling of a graph $G$, $\phi:V(G)\to\{1,2,\dots,r\}$ is said to be $r$-distinguishing if for any $\sigma\in\mathrm{Aut}(G)$, $\sigma \neq\mathrm{id}$, there is a vertex $x$ such that $\phi(x)\neq\phi(\sigma(x))$. That is, $\phi$ is $r$-distinguishing if no nontrivial automorphism of $G$ preserves all the vertex labels. The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a $d$-distinguishing labeling. Distinguishing labeling for graphs was introduced by \textit{M. O. Albertson} and \textit{K. L. Collins} [Electron. J. Comb. 3, No. 1, Research paper R18 (1996; Zbl 0851.05088)]. Note, $D(K_n)=n$ for the complete graph $K_n$ and $D(P_n)=2$ where $n\geq 2$ and $P_n$ is a path with $n$ vertices. In this paper, the authors discuss this concept for trees and show: \begin{itemize} \item[1.] If $T$ is a tree of radius at most two, then $D(T)=2$ if and only if $T$ is one of the trees that the authors have shown in Figure 2. \item[2.] There is no tree $T$ with diameter three, radius $\mathrm{rad}(T)\geq 3$ and $D(T)=2$. \item[3.]If $T$ is a tree with radius $\mathrm{rad}(T)\geq 3$ and $D(T)=2$, then the complement $\bar{T}$ of $T$ is a connected 2-self-centered graph that is not bipartite. \end{itemize} After further discussion of self-centered graphs, the authors end the paper with a Question: Characterize edges which add to each edge-minimal 2-self-centered graph such that $D(T)=2$.