%0 Journal Article
%T An upper bound on the algebraic connectivity of regular graphs
%A Sera Aylin Cakiroglu
%J Mathematics
%D 2015
%I arXiv
%X 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.
%U http://arxiv.org/abs/1503.01758v1