Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov
The algebraic connectivity of a graph $G$ is a well-studied graph invariant that is related to other properties of the graph such as connectivity and expansion. Given $n$ and $m$, $\alpha(n,m)$ is the maximum algebraic connectivity of a graph with $n$ vertices and $m$ edges. In 2015, Kolokolnikov conjectured that $\alp...