It is well known that the spectral radius of a tree with at least vertices has the property that , where is the maximum degree of . Let denote the set of spectral radii of all non-trivial trees. In this article, we study the inverse problem that for any and integer satisfying the condition , is there a tree such that and ? For any positive integer and positive number , let denote a set of non-negative real numbers defined as follows: , and for any multi-set , if and , then . We first show that if and only if there exists a tree with and . It follows directly that is exactly the set of positive numbers such that . Applying this conclusion, we prove that for any two positive integers and , there exists a tree with and if and only if .

生成讲解博客的中文版本

生成AI智能校验的中文版本