SE(s) extremal conjecture for weighted Laplacian spread

From papers

Let GG be a weighted graph on n5n\geq 5 vertices, with every edge weight in [0,1][0,1], and let GcG^c be its weighted complement. Write

x=λ2(G),y=λ2(Gc).x=\lambda_2(G),\qquad y=\lambda_2(G^c).

An SE(s)(s) graph is the weighted graph family defined earlier in the paper.

SE(s)(s) extremal conjecture. The quantities xx and yy satisfy

x+y2xyn1,x+y-\frac{2xy}{n}\geq 1,

with equality when GG is an SE(s)(s) graph. The conjecture proposes that the SE(s)(s) family gives the extreme values of Laplacian spread among weighted graphs with non-negative weights whose complements also have non-negative weights; its general status is unresolved.

Progress summary

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

Sources & referencesView supporting material

Primary source

Wayne Barrett, Emily Evans, H. Tracy Hall and Mark Kempton, “New conjectures on algebraic connectivity and the Laplacian spread of graphs”, arXiv:2201.04225 (2022).

Solutions 0

No solutions have been posted yet.