Laplacian spread equality characterization conjecture

At least 11 years old · documented by

Let GG be a graph with nn vertices, let G‾\overline G be its complement, and let K1K_1 denote the one-vertex complete graph. The join of graphs is denoted by ∨\vee, and a graph is disconnected when it is not connected. Laplacian spread equality conjecture.

μ1(G)−μn−1(G)≤n−1\mu_1(G)-\mu_{n-1}(G)\leq n-1

(or equivalently μ1(G)+μ1(G‾)≤2n−1\mu_1(G)+\mu_1(\overline G)\leq 2n-1), with equality if and only if GG or G‾\overline G is isomorphic to K1∨HK_1\vee H for a disconnected graph HH of order n−1n-1. This is the proposed full form of the Laplacian spread conjecture; the equality characterization remains open in general.

References

Primary source

F. Ashraf and B. Tayfeh-Rezaie, “Nordhaus–Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues”, arXiv:1402.2995 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.