An improved lower bound for the Seidel energy of trees (Q2166255)

\textit{W. H. Haemers} [MATCH Commun. Math. Comput. Chem. 68, No. 3, 653--659 (2012; Zbl 1289.05290)] conjectured that the Seidel energy of any graph of order \(n\) is at least \(2n-2\). We establish the validity of Haemers' conjecture in general. Later, \textit{S. Akbari} et al. [Eur. J. Comb. 86, Article ID 103078, 8 p. (2020; Zbl 1437.05130] proved this conjecture. In this paper, the authors improve this bound for trees.