Laplacian spread of a graph is the difference among the largest and the second smallest Laplacian eigenvalue of the graph. Is there any result or conjecture that discusses about the graphs having minimum Laplacian spread in the class of all connected graphs with prescribed order $n$.