A bound on the spectral radius of graphs in terms of their Zagreb indices (Q2174091)

Let \(G=(V,E)\) be a connected and simple graph with \(n\) vertices, \(m\) edges and adjacency matrix \(A\). Denote by \(\lambda_1\geq \dots \geq \lambda_n\) the eigenvalues of \(A\). An eigenvalue is called main if its eigenspace is not perpendicular to the all-one vector \(j\). \textit{E. M. Hagos} [Linear Algebra Appl. 356, No. 1--3, 103--111 (2002; Zbl 1015.05051)] proved that the number of main eigenvalues of \(G\) equals the largest \(k\) such that \(j,Aj,\dots,A^{k-1}j\) are linearly independent. For a vertex \(v\in V\), denote by \(d_v\) its degree. The first Zagreb index of \(G\) is defined as \[ M_1=\sum_{v\in V}d_v^2=j^TA^2j, \] and the second Zagreb index of \(G\) is defined as: \[ M_2=\sum_{uv\in E}d_ud_v=\frac{j^TA^3j}{2}. \] Let \(\alpha=\frac{2(nM_2-mM_1)}{nM_1-4m^2}\) and \(\beta=\frac{M_1^2-4mM_2}{nM_1-4m^2}\). The main result of this paper is that \[ \lambda_1\geq \frac{\alpha+\sqrt{\alpha^2+4\beta}}{2}, \] with equality if and only if \(G\) has exactly two main eigenvalues. Explicit comparisons with other bounds on \(\lambda_1\) are also provided in the paper.