  We conjecture a new lower bound on the algebraic connectivity of a graph that
involves the number of vertices of high eccentricity in a graph. We prove that
this lower bound implies a strengthening of the Laplacian Spread Conjecture. We
discuss further conjectures, also strengthening the Laplacian Spread
Conjecture, that include a conjecture for simple graphs and a conjecture for
weighted graphs.
