Attainable bounds for algebraic connectivity and maximally connected regular graphs

Abstract

We derive attainable upper bounds on the algebraic connectivity (spectral gap) of a regular graph in terms of its diameter and girth. This bound agrees with the well-known Alon–Boppana–Friedman bound for graphs of even diameter, but is an improvement for graphs of odd diameter. For the girth bound, we show that only Moore graphs can attain it, and these only exist for well-known special cases. For the diameter bound, we use a combination of stochastic algorithms and exhaustive search to find graphs which attain it. For 3-regular graphs, we find attainable graphs for all diameters $D$ up to and including $D=9$ (the case of $D=10$ is open). These graphs are extremely rare and also have high girth; for example, we found exactly 45 distinct cubic graphs on 44 vertices attaining the upper bound when $D=7$; all have girth 8. We also exhibit several infinite families attaining the upper bound with respect to diameter or girth. In particular, when $d$ is a power of prime, we construct a $d$-regular graph having diameter 4 and girth 6 which attains the upper bound with respect to diameter.