The planar graph algebraic-connectivity conjecture
Statement
Let be a planar graph, and let denote its algebraic connectivity, the second-smallest eigenvalue of its Laplacian. The graphs and are the complete graph on four vertices and the join of two isolated vertices with a four-cycle, respectively. Planar algebraic-connectivity conjecture.
with equality if and only if or . If is neither of these graphs, then .
The conjecture would determine the maximum algebraic connectivity of planar graphs and its equality cases; the source reports that it has not been proved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.