An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
From MaRDI portal
Publication:2449111
DOI10.1016/j.dam.2014.02.020zbMath1288.05160OpenAlexW1991994646MaRDI QIDQ2449111
Wai Chee Shiu, Ji-Ming Guo, An Chang, Jian Xi Li
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.02.020
Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs, Effects on the normalized Laplacian spectral radius of non-bipartite graphs under perturbation and their applications, 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, Unnamed Item, 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}\), On the second largest normalized Laplacian eigenvalue of graphs, Distance between the normalized Laplacian spectra of two graphs, Normalized Laplacian eigenvalues with chromatic number and independence number of graphs, On the second smallest and the largest normalized Laplacian eigenvalues of a graph, Normalized algebraic connectivity of graphs, Normalized Laplacian spectrum of complete multipartite graphs, ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the normalized Laplacian spectra
- The algebraic connectivity of graphs under perturbation
- The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- An Interlacing Result on Normalized Laplacians
