| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602497 | Linear Algebra and its Applications | 2009 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
