Abstract
The spectral radius rho(G) of a graph G is the largest eigenvalue of its adjacency matrix A(G). In this paper, we first give a sharp lower bound of th......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
