1 paper
Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada +1
For a graph G, let λ2(G) denote the second largest eigenvalue of the adjacency matrix of G. We determine the extremal trees with maximum/minimum adjacency eigenvalue λ2 i…