Department of Mathematics
The Laplacian spectral radius of some graphs
The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we determine those graphs which maximize the Laplacian spectral radius among all bipartite graphs with (edge-)connectivity at most k. We also characterize graphs of order n with k cut-edges, having Laplacian spectral radius equal to n. © 2009 Elsevier Inc. All rights reserved.
Connectivity, Cut-edge, Laplacian spectral radius
Source Publication Title
Linear Algebra And Its Applications
Li, Jianxi, Wai Chee Shiu, and Wai Hong Chan. "The Laplacian spectral radius of some graphs." Linear Algebra And Its Applications 431.2-1 (2009): 99-103.