The algebraic connectivity of graphs with given stability number

Abstract

In this paper, we investigate the algebraic connectivity of connected graphs, and determine the graph which has the minimum algebraic connectivity among all connected graphs of order $n$ with given stability number $\alpha\geq\lceil\frac{n}{2}\rceil$, or covering number, respectively.