Ordering quasi-tree graphs by the second largest signless Laplacian eigenvalues

DOI10.3770/J.ISSN:2095-2651.2020.05.002zbMATH Open1463.05058MaRDI QIDQ3385949FDOQ3385949

Authors Zhen Lin, Shu-Guang Guo, Lianying Miao

Publication date 14 January 2021

zbMATH Keywords

orderingsecond largest eigenvaluesignless Laplacian matrixsum of eigenvaluesquasi-tree graph

Mathematics Subject Classification ID

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

Recommendations

• Ordering quasi-tree graphs on \(n\) vertices by their spectral radii
• On the \(Q\)-index and index of triangle-free quasi-tree graphs.
• On the maximum signless Laplacian spectral radius of quasi-tree graph
• On the spectral radius of quasi-tree graphs
• Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\)

Cited in

(6)

• Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
• scientific article; zbMATH DE number 6986927 (Why is no real title available?)
• On the \(Q\)-index and index of triangle-free quasi-tree graphs.
• On the maximum signless Laplacian spectral radius of quasi-tree graph
• Ordering quasi-tree graphs on \(n\) vertices by their spectral radii
• Ordering \(Q\)-indices of graphs: given size and circumference

This page was built for publication: Ordering quasi-tree graphs by the second largest signless Laplacian eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385949)