Properties and Applications of the Eigenvector Corresponding to the Laplacian Spectral Radius of a Graph

Haizhou Song and Qiufen Wang

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

Abstract:

We study the properties of the eigenvector corresponding to the Laplacian spectral radius of a graph and show some applications. We obtain some results on the Laplacian spectral radius of a graph by grafting and adding edges. We also determine the structure of the maximal Laplacian spectrum tree among trees with vertices and pendant vertices ( , fixed), and the upper bound of the Laplacian spectral radius of some trees.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/524162.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/524162.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:524162

DOI: 10.1155/2013/524162

Access Statistics for this article

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