DocumentCode
3297897
Title
An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs
Author
Roy, Sandip ; Wan, Yan
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Washington State Univ., Pullman, WA, USA
fYear
2009
fDate
15-18 Dec. 2009
Firstpage
4785
Lastpage
4789
Abstract
We obtain an explicit formula for the absolute difference between two eigenvector components for a weighted graph´s Laplacian matrix, in terms of the the Laplacian´s eigenvalues as well as the eigenvalues of matrices associated with certain coalesced graphs. We then briefly illustrate two uses of this formula, in analyzing graph modifications.
Keywords
Laplace equations; eigenvalues and eigenfunctions; graph theory; Laplacian matrix; Laplacian-eigenvector components; absolute difference; coalesced graph; eigenvalue; graph modification; weighted graph; Algorithm design and analysis; Distributed control; Eigenvalues and eigenfunctions; Laplace equations; Network topology; Resource management; Statistics; Stress; Symmetric matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on
Conference_Location
Shanghai
ISSN
0191-2216
Print_ISBN
978-1-4244-3871-6
Electronic_ISBN
0191-2216
Type
conf
DOI
10.1109/CDC.2009.5399786
Filename
5399786
Link To Document