1 paper
Lele Liu, Bo Ning
Let G be an n-vertex graph, and let I^»(G) and I^»n(G) denote the largest and smallest eigenvalues of its adjacency matrix. Write e(G) for the number of edges of G, $d(G…