A note on Fiedler vectors interpreted as graph realizations

DOI10.1016/J.ORL.2010.01.005MaRDI QIDQ991473zbMATH OpenOpenAlexFDO

Authors Christoph Helmberg, Susanna Reiss

Publication date 7 September 2010

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2010.01.005

zbMATH Keywords

spectral graph theorysemidefinite programmingembeddingeigenvalue optimizationgraph partitioningFiedler vectors

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Semidefinite programming (90C22)

Recommendations

• Fiedler vector analysis for particular cases of connected graphs
• On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
• A note on vector representation of graphs
• A note on \(f\)-graphs
• Some Recent Results on the Graphs of Finite-Dimensional Vector Spaces
• Realization of graphs by fold Gauss maps
• On the regular graphs of finite dimensional vector spaces
• Graphs and their real eigenvectors
• scientific article; zbMATH DE number 3851133
• Feynman graphs and hyperplane arrangements defined over \(\mathbb{F}_1\)

Cites work

• scientific article; zbMATH DE number 4208110 (Why is no real title available?)
• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 2149406 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Absolute algebraic connectivity of trees
• Consistency of spectral clustering
• Embedded in the Shadow of the Separator
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem

Cited in

(9)

• Invertibility of graph translation and support of Laplacian Fiedler vectors
• On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
• A cascadic multigrid algorithm for computing the Fiedler vector of graph Laplacians
• Potential energy principles in networked systems and their connections to optimization problems on graphs
• Perturbation of Fiedler vector: interest for graph measures and shape analysis
• On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
• On minimizing the spectral width of graph Laplacians and associated graph realizations
• Ordering trees and graphs with few cycles by algebraic connectivity
• Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian

This page was built for publication: A note on Fiedler vectors interpreted as graph realizations

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