Paper detail

Graphs with the minimum spectral radius for given independence number

Let $\mathbb{G}_{n,α}$ be the set of connected graphs with order $n$ and independence number $α$. Given $k=n-α$, the graph with minimum spectral radius among $\mathbb{G}_{n,α}$ is called the minimizer graph. Stevanović in the classical book [D. Stevanović, Spectral Radius of Graphs, Academic Press, Amsterdam, 2015.] pointed that determining minimizer graph in $\mathbb{G}_{n,α}$ appears to be a tough problem on page $96$. Very recently, Lou and Guo in \cite{Lou} proved that the minimizer graph of $\mathbb{G}_{n,α}$ must be a tree if $α\ge\lceil\frac{n}{2}\rceil$. In this paper, we further give the structural features for the minimizer graph in detail, and then provide of a constructing theorem for it. Thus, theoretically we completely determine the minimizer graphs in $\mathbb{G}_{n,α}$ along with their spectral radius for any given $k=n-α\le \frac{n}{2}$. As an application, we determine all the minimizer graphs in $\mathbb{G}_{n,α}$ for $α=n-1,n-2,n-3,n-4,n-5,n-6$ along with their spectral radii, the first four results are known in \cite{Xu,Lou} and the last two are new.