The trees with the second smallest normalized Laplacian eigenvalue at least 1-32
From MaRDI portal
Publication:507585
DOI10.1016/J.DAM.2016.12.010zbMATH Open1355.05162OpenAlexW2570176964MaRDI QIDQ507585FDOQ507585
Authors: Xiao-guo Tian, Ligong Wang 
Publication date: 6 February 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.010
Recommendations
- On the second largest Laplacian eigenvalue of trees
- Most Laplacian eigenvalues of a tree are small
- On the number of Laplacian eigenvalues of trees smaller than two
- Thekth Laplacian eigenvalue of a tree
- scientific article; zbMATH DE number 1930773
- Trees with maximum sum of the two largest Laplacian eigenvalues
- On the second largest Laplacian eigenvalues of trees with nearly perfect matchings
- On the sum of the two largest Laplacian eigenvalues of trees
- On the \(s\)th Laplacian eigenvalue of trees of order \(st+1\)
- On the second Laplacian eigenvalues of trees of odd order
Cites Work
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some notes on graphs whose spectral radius is close to \(\frac{3}{2}\sqrt 2\)
- Open problems of Paul Erd�s in graph theory
- On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs
- Title not available (Why is that?)
- On Randić energy
- Randić energy and Randić eigenvalues
- 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 effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
- On Randić energy
- A note on Randić energy
- Normalized Laplacian energy change and edge deletion
Cited In (11)
- Normalized algebraic connectivity of graphs
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees
- Most Laplacian eigenvalues of a tree are small
- 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
- Normalized Laplacian spectrum of complete multipartite graphs
- Characterization of graphs with the limited normalized algebraic connectivity
- Normalized Laplacian eigenvalues and energy of trees
- Normalized Laplacian eigenvalues with chromatic number and independence number of graphs
- On the second Laplacian eigenvalues of trees of odd order
- On the second largest normalized Laplacian eigenvalue of graphs
This page was built for publication: The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507585)
