An edge-rotating theorem on the least eigenvalue of graphs

DOI10.1007/s10255-015-0512-2zbMath1338.05166OpenAlexW2249416179MaRDI QIDQ277068

Rui-fang Liu, Hui-cai Jia, Jin-Long Shu

Publication date: 4 May 2016

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-015-0512-2

zbMATH Keywords

adjacency matrixleast eigenvaluerotating an edge

Mathematics Subject Classification ID

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

Related Items (1)

Spectral distances in some sets of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• Graphs for which the least eigenvalue is minimal. I
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On the spectral radius of unicyclic graphs with prescribed degree sequence
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• The least eigenvalue of signless Laplacian of graphs under perturbation
• Towards a spectral theory of graphs based on the signless Laplacian, I

This page was built for publication: An edge-rotating theorem on the least eigenvalue of graphs