Abstract
The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of its Laplacian matrix. In this paper, we determine the graphs whose line graphs achieve the smallest and the largest Laplacian spread, respectively, among all connected graphs with m≥3 edges, and we also determine the unique tree whose line graph achieves the smallest Laplacian spread among all non-star trees with m≥3 edges.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
