  We derive a new upper bound on the algebraic connectivity of a regular graph
using the Higman-Sims technique. Together with a new result on the connectivity
of the neighbourhood graph of strongly regular graphs, our result gives a
characterization of a class of strongly regular graphs that maximize the
algebraic connectivity amongst regular graphs.
