Distance between the normalized Laplacian spectra of two graphs
From MaRDI portal
Publication:2013193
Recommendations
Cites work
- An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
- Analytic Inequalities
- Bounds on normalized Laplacian eigenvalues of graphs
- Cospectrality of graphs
- Distance between spectra of graphs
- scientific article; zbMATH DE number 6704610 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Normalized Laplacian eigenvalues and energy of trees
- On Randić energy
- On Randić energy
- On the normalized Laplacian eigenvalues of graphs.
- Research problems from the Aveiro workshop on graph spectra
- Six classes of trees with largest normalized algebraic connectivity
- Spectral distances of graphs
- The variation of the spectrum of a normal matrix
Cited in
(9)- Laplacian and normalized Laplacian spectral distances of graphs
- On the normalized distance Laplacian eigenvalues of graphs
- Comparing large-scale graphs based on quantum probability theory
- Distance between the spectra of graphs with respect to normalized Laplacian spectra
- Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations
- The normalized distance Laplacian
- Proof of a conjecture on spectral distance between cycles, paths and certain trees
- Cospectrality of multipartite graphs
- Spectral classes of regular, random, and empirical graphs
This page was built for publication: Distance between the normalized Laplacian spectra of two graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013193)