Graph Embeddings and Laplacian Eigenvalues
DOI10.1137/S0895479897329825zbMATH Open0942.05040OpenAlexW2010434073MaRDI QIDQ4943655FDOQ4943655
Authors: Stephen Guattery, Gary L. Miller 
Publication date: 19 March 2000
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479897329825
Recommendations
- The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
- On sums of graph eigenvalues
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
- Lower bounds of the Laplacian graph eigenvalues
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (14)
- Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
- The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
- SYNCHRONIZATION AND GRAPH TOPOLOGY
- Stability analysis for multi-agent systems using the incidence matrix: quantized communication and formation control
- Projective Nonnegative Graph Embedding
- GLEE: geometric Laplacian eigenmap embedding
- Spectrally robust graph isomorphism
- Embedding the diamond graph in \(L_p\) and dimension reduction in \(L_1\)
- Title not available (Why is that?)
- Embedding and the first Laplace eigenvalue of a finite graph
- Multiway spectral clustering: a margin-based perspective
- Spectral embedding of graphs.
- Family of controllers for attitude synchronization on the sphere
- Enhanced graph-based dimensionality reduction with repulsion Laplaceans
This page was built for publication: Graph Embeddings and Laplacian Eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943655)
