New classes of integral trees of diameter 4

A graph is called integral if all eigenvalues of its adjacency matrix are integers. In this paper, we investigate integral trees S(r; m₁) = S(a₁ + a₂ +... + a_s;m₁, m ₂,..., m_s) of diameter 4 with s = 2, 3. We give a better sufficient and necessary condition for the tree S(a₁+a ₂;m₁,m₂) of diameter 4 to be integral, from which we construct infinitely many new classes of such integral trees by solving some certain Diophantine equations. These results are different from those in the existing literature. We also construct new integral trees S(a₁ +a₂+ a₃; m₁, m₂, m₃) = S(a₁ + 1 + 1;m₁, m₂, m₃) of diameter 4 with non-square numbers m₂ and m₃. These results generalize some well-known results of P.Z. Yuan, D.L. Zhang et al.