Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case

Zeru Zhu, Jinzheng Li, Yuanjie Ren +1

Kolokolnikov conjectured that, among all simple graphs on \(n\) vertices with exactly \(2(n-2)\) edges, the complete bipartite graph maximizes algebraic connectivity. This paper pr…