On graphs whose least eigenvalue is greater than –2

DOI10.1080/03081087.2015.1107020MaRDI QIDQ5741229zbMATH OpenOpenAlexFDO

Authors Francesco Belardo, Tomaž Pisanski, Slobodan K. Simić

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 matrixleast eigenvalueline graphsigned graphsubdivision graphHOMO-LUMO

Mathematics Subject Classification ID

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

Recommendations

• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• scientific article; zbMATH DE number 95308
• Notes on graphs with least eigenvalue at least \(-2\)
• On graphs with the smallest eigenvalue at least \(-1 - \sqrt 2\). II
• scientific article; zbMATH DE number 5202622
• scientific article; zbMATH DE number 500503
• scientific article; zbMATH DE number 3869370
• On graphs with exactly one eigenvalue less than -1
• On graphs whose second largest eigenvalue is less than 1
• On graphs with at least three distance eigenvalues less than \(-1\)

Cites work

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

Cited in

(13)

• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• Fat Hoffman graphs with smallest eigenvalue greater than -3
• On graphs with at most three Laplacian eigenvalues greater than or equal to two.
• On graphs with smallest eigenvalue at least \(-3\) and their lattices
• On eigenspaces of some compound signed graphs
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• scientific article; zbMATH DE number 3869370 (Why is no real title available?)
• On the nullity of connected graphs with least eigenvalue at least -2
• Graphs with least eigenvalue -2: ten years on
• Total graph of a signed graph
• Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs
• On fat Hoffman graphs with smallest eigenvalue at least -3
• On graphs with at least three distance eigenvalues less than \(-1\)

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

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