An upper bound on the algebraic connectivity of regular graphs
Combinatorics
2015-03-06 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1503.01758,
title = {An upper bound on the algebraic connectivity of regular graphs},
author = {Sera Aylin Cakiroglu},
journal= {arXiv preprint arXiv:1503.01758},
year = {2015}
}