The Minimal Spectral Radius with Given Independence Number

Abstract

In this paper, we determine the graphs which have the minimal spectral radius among all the connected graphs of order n and the independence number left ceiling n2 right ceiling -1.\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\lceil \frac{n}{2}\rceil -1.$$\end{document}