An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian

DOI10.1016/j.laa.2012.10.005zbMath1257.05084OpenAlexW2059153486WikidataQ43075230 ScholiaQ43075230MaRDI QIDQ1931722

Eric A. Stone, Alexander R. Griffing, Benjamin R. Lynch

Publication date: 16 January 2013

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

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

zbMATH Keywords

Schur complementeigenvectorsharmonic functionsinterlacingnodal domainspartially-supplied graph

Mathematics Subject Classification ID

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

Related Items (2)

Schur reduction of trees and extremal entries of the Fiedler vector ⋮ Structural properties of the minimum cut of partially-supplied graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Some geometric aspects of graphs and their eigenfunctions
• A discrete nodal domain theorem for trees
• Applications of M-matrices to non-negative matrices
• NOTE ON M-MATRICES
• Kron Reduction of Graphs With Applications to Electrical Networks
• Determining the Resistors in a Network
• A Recurring Theorem on Determinants
• Discrete nodal domain theorems

This page was built for publication: An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian