SE(s) extremal conjecture for weighted Laplacian spread
SE(s) extremal conjecture for weighted Laplacian spread
Let be a weighted graph on vertices, with every edge weight in , and let be its weighted complement. Write
An SE graph is the weighted graph family defined earlier in the paper.
SE extremal conjecture. The quantities and satisfy
with equality when is an SE graph. The conjecture proposes that the SE 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
Sign in to submit a solution.
No solutions have been posted yet.