1. The Laplacian spread of graphs
- Creator:
- You, Zhifu and Liu, Bolian
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- Laplacian eigenvalues and spread
- Language:
- English
- Description:
- The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread, several upper bounds of the Nordhaus-Gaddum type of Laplacian eigenvalues are improved. Some operations on Laplacian spread are presented. Connected $c$-cyclic graphs with $n$ vertices and Laplacian spread $n-1$ are discussed.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public