Spectrum radii of trees

For any positive integer $r$ and positive number $\alpha$, let ${\mathscr W}_r(\alpha)$ denote the set of positive numbers defined recursively: $\alpha\in {\mathscr W}_r(\alpha)$, and for any multi-set $\{q_i\in {\mathscr W}_r(\alpha): 1\le i\le s\}$, where $1\le s<r$, $\beta:=\alpha-\sum\limits_{i=1}^sq_i^{-1}$ belongs to ${\mathscr W}_r(\alpha)$ as long as $\beta>0$. We first show that there exists a tree $T$ such that its maximum degree $\Delta(T)$ is at most $r$ and its spectrum radius $\lambda(T)$ is equal to $\alpha$ if and only if $\alpha^{-1}\in {\mathscr W}_r(\alpha)$. It follows that the set of spectrum radii of non-trivial trees is exactly the set of positive numbers $\alpha$ such that $\alpha^{-1}\in {\mathscr W}_{\lfloor\alpha^2\rfloor}(\alpha)$. Applying this conclusion, we then prove that for any positive integers $r$ and $k$, there exists a tree $T$ with $\Delta(T)=r$ and $\lambda(T)=\sqrt k$ if and only if $\frac 14 k+1<r\le k$.