1. On the second largest normalized Laplacian eigenvalue of graphs.
- Author
-
Sun, Shaowei and Das, Kinkar Ch.
- Subjects
- *
LAPLACIAN matrices , *EIGENVALUES , *BIPARTITE graphs , *MATHEMATICAL bounds , *MATHEMATICAL analysis - Abstract
Abstract Let G = (V , E) be a simple graph of order n with normalized Laplacian eigenvalues ρ 1 ≥ ρ 2 ≥ ⋯ ≥ ρ n − 1 ≥ ρ n = 0. The normalized Laplacian spread of graph G , denoted by ρ 1 − ρ n − 1 , is the difference between the largest and the second smallest normalized Laplacian eigenvalues of graph G. In this paper, we obtain the first four smallest values on ρ 2 of graphs. Moreover, we give a lower bound on ρ 2 of connected bipartite graph G except the complete bipartite graph and characterize graphs for which the bound is attained. Finally, we present some bounds on the normalized Laplacian spread of graphs and characterize the extremal graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF