Distance between the normalized Laplacian spectra of two graphs

DOI10.1016/j.laa.2017.05.025zbMath1367.05126OpenAlexW2616568103MaRDI QIDQ2013193

Shaowei Sun, Kinkar Chandra Das

Publication date: 3 August 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.05.025

zbMATH Keywords

spectral distancecospectralitynormalized Laplacian eigenvaluesRandić energynormalized Laplacian matrix of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Cospectrality of multipartite graphs ⋮ Comparing large-scale graphs based on quantum probability theory ⋮ Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations ⋮ Proof of a conjecture on spectral distance between cycles, paths and certain trees

Cites Work

• Bounds on normalized Laplacian eigenvalues of graphs
• Distance between spectra of graphs
• Normalized Laplacian eigenvalues and energy of trees
• Spectral distances of graphs
• On Randić energy
• An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
• Cospectrality of graphs
• Six classes of trees with largest normalized algebraic connectivity
• Research problems from the Aveiro workshop on graph spectra
• The variation of the spectrum of a normal matrix
• Analytic Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item