An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs

DOI10.1016/J.LAA.2010.05.012MaRDI QIDQ5962285zbMATHOpenAlexFDO

Authors Sandip Roy, Yan Wan

Publication date 21 September 2010

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2010.05.012

zbMATH Keywords

graph theoryLaplacian matrixcontrol theoryspecial coordinate basis

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Laplacian graph eigenvectors
• Determinants of Laplacians on graphs
• Some properties of Laplacian eigenvectors
• On the connection between the eigen-vectors of weighted graphs and their subgraphs
• Laplacian eigenvector of mixed graph

Cites work

• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Laplacian graph eigenvectors
• Loop transfer recovery. Analysis and design
• On algebraic connectivity as a function of an edge weight
• On time-scale designs for networks
• Scaling: a canonical design problem for networks
• Special coordinate basis for multivariable linear systems—finite and infinite zero structure, squaring down and decoupling

Cited in

(4)

• scientific article; zbMATH DE number 3985282 (Why is no real title available?)
• Designing linear distributed algorithms with memory for fast convergence
• On the connection between the eigen-vectors of weighted graphs and their subgraphs
• Three conjectures of Ostrander on digraph Laplacian eigenvectors

This page was built for publication: An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962285)