Let G be an irregular graph on n vertices with maximum degree \(\Delta \ge 3\) and diameter \(D\ge 3\). The spectral radius of G, which is denoted by \(\rho (G)\), is the largest eigenvalue of the adjacency matrix of G. In this paper, a new lower bound of \(\Delta -\rho (G)\) is given, which improves the previous bounds intrinsically.

中文翻译：

---

关于谱半径和不规则图的最大度的注记

令G为最大度数\（\ Delta \ ge 3 \）和直径\（D \ ge 3 \）的n个顶点上的不规则图。的谱半径ģ，这是由表示\（\ RHO（G）\） ，是的邻接矩阵的最大特征值G ^。在本文中，给出了新的\（\ Delta-\ rho（G）\）下界，从本质上改善了先前的界限。