ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph, and let a(G)a(G) denote its algebraic connectivity, the second-smallest eigenvalue of its Laplacian. The graphs K4K_4 and 2K1+˙C42K_1\dot{+}C_4 are the complete graph on four vertices and the join of two isolated vertices with a four-cycle, respectively. Planar algebraic-connectivity conjecture.

a(G)≤4,a(G)\leq 4,

with equality if and only if G=K4G=K_4 or G=2K1+˙C4G=2K_1\dot{+}C_4. If GG is neither of these graphs, then a(G)≤3a(G)\leq 3.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.