1 paper
Sahil Agarwal, Carter Antley, Joseph Aulenbacher +6
For a graph G, let λ1(G)≥λ2(G)≥⋯≥λn(G) denote the adjacency eigenvalues of G. We prove that for all looped graphs G on n vertices, \[λ_1(G) + λ_2(\over…