Schur reduction of trees and extremal entries of the Fiedler vector

DOI10.1016/j.laa.2019.02.008zbMath1411.05160arXiv1807.01084OpenAlexW2963776588WikidataQ128371896 ScholiaQ128371896MaRDI QIDQ2418995

Hannes Gernandt, Jan Philipp Pade

Publication date: 29 May 2019

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

Full work available at URL: https://arxiv.org/abs/1807.01084

zbMATH Keywords

Schur complementalgebraic connectivityFiedler vectorLaplacian matrices

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Related Items

Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ Perturbation of Fiedler vector: interest for graph measures and shape analysis ⋮ On the hot spots of quantum graphs ⋮ A spectral approach to the shortest path problem ⋮ Spectral clustering revisited: information hidden in the Fiedler vector

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplace eigenvalues of graphs---a survey
• On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
• Old and new results on algebraic connectivity of graphs
• A counterexample to the ``hot spots conjecture
• On the ``hot spots conjecture of J. Rauch
• Laplacian graph eigenvectors
• Graph properties for splitting with grounded Laplacian matrices
• The Schur complement and its applications
• An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
• Mysteries around the graph Laplacian eigenvalue 4
• Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
• The number of caterpillars
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Community detection based on network communicability
• Laplacian Spectra and Synchronization Processes on Complex Networks
• Characteristic vertices of weighted trees via perron values
• The Laplacian Spectrum of a Graph
• Thekth Laplacian eigenvalue of a tree
• Combinatorial Perron values of trees and bottleneck matrices
• Kron Reduction of Graphs With Applications to Electrical Networks
• On trees with maximum algebraic connectivity
• The Rotation of Eigenvectors by a Perturbation. III
• An Inverse Matrix Adjustment Arising in Discriminant Analysis

This page was built for publication: Schur reduction of trees and extremal entries of the Fiedler vector