The normalized algebraic-connectivity Nordhaus-Gaddum conjecture
The normalized algebraic-connectivity Nordhaus-Gaddum conjecture
Let be a graph on vertices, let be its complement, and let denote the second-smallest eigenvalue of the normalized Laplacian of .
Normalized algebraic-connectivity conjecture.
The conjecture is motivated by focus graphs, for which the two normalized algebraic connectivities approach while their sum approaches . The supplied text does not provide a proof, disproof, or further resolution.
Sources & referencesView supporting material
Primary source
Mark Kempton, Xavier Zaitzeff and Sibi Muthuprakash, “Nordhaus-Gaddum upper bounds for graph connectivity parameters”, arXiv:2606.12751 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.