On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian

DOI10.1016/j.laa.2009.06.024zbMath1193.05111OpenAlexW1995051706WikidataQ41630414 ScholiaQ41630414MaRDI QIDQ732077

Alexander R. Griffing, Eric A. Stone

Publication date: 9 October 2009

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

Full work available at URL: http://europepmc.org/articles/pmc3587722

zbMATH Keywords

Schur complementtreesgraph LaplaciansFiedler vectorsPerron components

Mathematics Subject Classification ID

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

Related Items (3)

An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian ⋮ 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
• The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
• Applications of M-matrices to non-negative matrices
• Characteristic vertices of weighted trees via perron values
• Perron components and algebraic connectivity for weighted graphs
• Rank one perturbation and its application to the laplacian spectrum of a graph^∗
• Algebraic connectivity of weighted trees under perturbation
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Algebraic connectivity and the characteristic set of a graph

This page was built for publication: On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian