The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
From MaRDI portal
Publication:3535384
DOI10.1080/03081080601143090zbMath1159.05317OpenAlexW2049435936MaRDI QIDQ3535384
Yi-Zheng Fan, Hong-Hai Li, Jiong-Sheng Li
Publication date: 11 November 2008
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080601143090
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (11)
Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs ⋮ The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications ⋮ On the normalized Laplacians with some classical parameters involving graph transformations ⋮ An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications ⋮ Six classes of trees with largest normalized algebraic connectivity ⋮ The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\) ⋮ The (normalized) Laplacian eigenvalue of signed graphs ⋮ On the second largest normalized Laplacian eigenvalue of graphs ⋮ On the second smallest and the largest normalized Laplacian eigenvalues of a graph ⋮ Normalized algebraic connectivity of graphs ⋮ A Fiedler-like theory for the perturbed Laplacian
Cites Work
This page was built for publication: The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
