A note on algebraic connectivity of 2-connected graphs

Abstract

Among all simple 2-connected graphs, and among all $\theta$-graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.

arXiv comment5 pages

References in corpus (2)

• The Algebraic Connectivity and the Clique Number of Graphs
• A lower bound for the algebraic connectivity of a graph in terms of the domination number