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

DOI10.1016/J.LAA.2010.05.012zbMATH Open1194.05096OpenAlexW1999828270MaRDI QIDQ5962285FDOQ5962285

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)

Cites Work

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

Cited In (2)

• Designing linear distributed algorithms with memory for fast convergence
• Three conjectures of Ostrander on digraph Laplacian eigenvectors

   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 👍 👎

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)