Laplacian spread equality characterization conjecture
Laplacian spread equality characterization conjecture
Let be a graph with vertices, let be its complement, and let denote the one-vertex complete graph. The join of graphs is denoted by , and a graph is disconnected when it is not connected. Laplacian spread equality conjecture.
(or equivalently ), with equality if and only if or is isomorphic to for a disconnected graph of order . This is the proposed full form of the Laplacian spread conjecture; the equality characterization remains open in general.
Sources & referencesView supporting material
Primary source
F. Ashraf and B. Tayfeh-Rezaie, “Nordhaus–Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues”, arXiv:1402.2995 (2014).
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.