Energy of graphs with no eigenvalue in the interval \((-1,1)\) (Q6087864)

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Motivated by a recent conjecture that the energy of a non-singular graph is at least the sum of its maximum and minimum vertex degrees [MATCH Commun. Math. Comput. Chem. 83, 631--633 (2020; Zbl. 1472.92265)], the author proves that if \(G\) is a graph with \(n\) vertices and \(m\) edges, with no eigenvalue of its adjacency matrix in the interval \((-1,1)\), then its energy is at least \(n-1+\sqrt{2m-n+1}\), with equality iff \(G\) is the union of \(r\) copies of \(K_2\) and \(s\) copies of \(K_p\) for some \(r\geq 0\), \(s\in\{0,1\}\) and \(p\geq 3\). Note that proofs of further special cases of the above conjecture may be found in [\textit{X. Li} and \textit{Z. Wang}, Bull. Malays. Math. Sci. Soc. (2) 45, No. 3, 991--1002 (2022; Zbl 1487.05165); \textit{S. Al-Yakoob} et al., MATCH Commun. Math. Comput. Chem. 86, No. 3, 577--586 (2021; Zbl 1474.92143)].