© 2018 Elsevier Inc.Let G be an undirected simple graph. The signless Laplacian spread of G is defined as the maximum distance of pairs of its signless Laplacian eigenvalues. This paper establishes some new bounds, both ...