Abstract
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. Copyright © 2009 Elsevier Inc. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 99-103 |
| Journal | Linear Algebra and Its Applications |
| Volume | 431 |
| Issue number | 1-2 |
| DOIs | |
| Publication status | Published - Jul 2009 |
Citation
Li, J., Shiu, W. C., & Chan, W. H. (2009). The Laplacian spectral radius of some graphs. Linear Algebra and Its Applications, 431(1-2), 99-103. doi: 10.1016/j.laa.2009.02.013Keywords
- Laplacian spectral radius
- Connectivity
- Cut-edge