A note on Fiedler vectors interpreted as graph realizations

DOI10.1016/j.orl.2010.01.005zbMath1194.05087OpenAlexW2160548060MaRDI QIDQ991473

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

embeddingeigenvalue optimizationsemidefinite programminggraph partitioningspectral graph theoryFiedler vectors

Mathematics Subject Classification ID

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

Related Items

On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs ⋮ Ordering trees and graphs with few cycles by algebraic connectivity

Cites Work

• Consistency of spectral clustering
• 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
• Embedded in the Shadow of the Separator
• Absolute algebraic connectivity of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item