The trees with the second smallest normalized Laplacian eigenvalue at least 1-32

DOI10.1016/J.DAM.2016.12.010MaRDI QIDQ507585zbMATHOpenAlexFDO

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

zbMATH Keywords

second smallest normalized Laplacian eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

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

• scientific article; zbMATH DE number 3465473 (Why is no real title available?)
• scientific article; zbMATH DE number 3512165 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 3794105 (Why is no real title available?)
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• A note on Randić energy
• An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
• Normalized Laplacian energy change and edge deletion
• On Randić energy
• On Randić energy
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
• On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs
• Open problems of Paul Erd�s in graph theory
• Randić energy and Randić eigenvalues
• Six classes of trees with largest normalized algebraic connectivity
• Some notes on graphs whose spectral radius is close to \(\frac{3}{2}\sqrt 2\)
• The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)

Cited in

(11)

• Normalized Laplacian eigenvalues with chromatic number and independence number of graphs
• Characterization of graphs with the limited normalized algebraic connectivity
• Minimum vertex covers and the spectrum of the normalized Laplacian on trees
• Normalized Laplacian spectrum of complete multipartite graphs
• On the second Laplacian eigenvalues of trees of odd order
• On the second largest normalized Laplacian eigenvalue of graphs
• An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
• Most Laplacian eigenvalues of a tree are small
• Six classes of trees with largest normalized algebraic connectivity
• Normalized Laplacian eigenvalues and energy of trees
• Normalized algebraic connectivity 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)