Sharp Upper Bounds for the Laplacian Spectral Radius of Graphs
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical problems associated with the network, from transient stability analysis of power network to distributed control of formations. Let G=(V,E) be a simple connected graph on n vertices and let μ(G) be the lar...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2013-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2013/720854 |