A note on Fiedler vectors interpreted as graph realizations
From MaRDI portal
Publication:991473
DOI10.1016/J.ORL.2010.01.005zbMATH Open1194.05087OpenAlexW2160548060MaRDI QIDQ991473FDOQ991473
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
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\)
spectral graph theorysemidefinite programmingembeddingeigenvalue optimizationgraph partitioningFiedler vectors
Cites Work
- Consistency of spectral clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- Embedded in the Shadow of the Separator
- Title not available (Why is that?)
- Title not available (Why is that?)
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Absolute algebraic connectivity of trees
- Title not available (Why is that?)
Cited In (9)
- Invertibility of graph translation and support of Laplacian Fiedler vectors
- A cascadic multigrid algorithm for computing the Fiedler vector of graph Laplacians
- On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
- 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)