On graphs whose least eigenvalue is greater than –2

DOI10.1080/03081087.2015.1107020zbMath1341.05149OpenAlexW2152414120MaRDI QIDQ5741229

Francesco Belardo, Tomaž Pisanski, Slobodan K. Simic

Publication date: 22 July 2016

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2015.1107020

zbMATH Keywords

adjacency matrixline graphsigned graphsubdivision graphleast eigenvalueHOMO-LUMO

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Signed and weighted graphs (05C22)

Related Items (2)

Total graph of a signed graph ⋮ On eigenspaces of some compound signed graphs

Cites Work

• Graphs with least eigenvalue \(-2\): ten years on
• Complete solution to a conjecture on the maximal energy of unicyclic graphs
• Signless Laplacians of finite graphs
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Median eigenvalues and the HOMO-LUMO index of graphs
• On the Laplacian coefficients of signed graphs
• Balancedness and the least eigenvalue of Laplacian of signed graphs
• Large regular bipartite graphs with median eigenvalue 1
• On the Laplacian Eigenvalues of Signed Graphs
• Ordering trees by algebraic connectivity

This page was built for publication: On graphs whose least eigenvalue is greater than –2