Graph Embeddings and Laplacian Eigenvalues
From MaRDI portal
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
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
- Stability analysis for multi-agent systems using the incidence matrix: quantized communication and formation control
- SYNCHRONIZATION AND GRAPH TOPOLOGY
- Projective Nonnegative Graph Embedding
- GLEE: geometric Laplacian eigenmap embedding
- Embedding the diamond graph in L_p and dimension reduction in L₁
- Spectrally robust graph isomorphism
- scientific article; zbMATH DE number 7370580 (Why is no real title available?)
- 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)