Upper bounds of the second largest eigenvalue of graphs

Abstract

Let $λ_i(G)$ denote the $i$-th largest eigenvalue of adjacency matrix of a graph $G$. Gerschgorin's Theorem indicates $λ_1(G)$ belongs to the largest disk, i.e., $λ_1(G)\leΔ_1(G)$, where $Δ_i(G)$ is the $i$-th largest degree of $G$. We show that $λ_2(G)$ lies in the second largest disk. That is, in detail, $$λ_2(G)<Δ_2(G)-\frac{1}{n^2}.$$ A classical theorem proved by Hong [\textit{Linear Algebra Appl.} 1988] states that $λ_1(G)\le\sqrt{2m-n+1}$ for a connected graph $G$ with $n$ vertices and $m$ edges, where the equality holds if and only if $G$ is a star $S_n$ or a complete graph $K_n$. We give a refinement of Hong's theorem by showing $$λ_1(G)<\sqrt{2m-n}$$ for any connected graph $G\not\in\left\{S_n,S^1_{n-1},K_n,K^1_{n-1}\right\}$. Based on this improved upper bound of $λ_1(G)$, for a connected graph $G$ with $n$ vertices and $m$ edges, we are able to prove a sharp upper bound of $λ_2(G)$ that $$λ_2(G)\le\sqrt{m-\frac{n}{2}-\frac{1}{2}},$$ except $G$ is obtained from two disjoint $S_\frac{n}{2}$ by adding an edge between a pendant vertex of each star. Moreover, we provide a complete characterization to extremal graphs attaining the equality.