Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))

DOI10.1007/s11464-019-0805-5zbMath1439.05142OpenAlexW2996158712MaRDI QIDQ2175476

Ji-Ming Guo, Zhi-Wen Wang, Xin Li

Publication date: 29 April 2020

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-019-0805-5

zbMATH Keywords

adjacency matrixleast eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further results on the least eigenvalue of connected graphs
• Graphs for which the least eigenvalue is minimal. I
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• Graphs for which the least eigenvalue is minimal. II.
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• The least eigenvalue of a graph with cut vertices
• Bicyclic graphs for which the least eigenvalue is minimum
• On the first eigenvalue of bipartite graphs
• A surprising property of the least eigenvalue of a graph
• On the eigenvalues of trees

This page was built for publication: Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))