Sharp Upper Bounds for the Laplacian Spectral Radius of Graphs

Houqing Zhou and Youzhuan Xu

Mathematical Problems in Engineering, 2013, vol. 2013, 1-4

Abstract:

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 be a simple connected graph on vertices and let be the largest Laplacian eigenvalue (i.e., the spectral radius) of . In this paper, by using the Cauchy-Schwarz inequality, we show that the upper bounds for the Laplacian spectral radius of .

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/720854.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/720854.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:720854

DOI: 10.1155/2013/720854

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().