On the nullity of connected graphs with least eigenvalue at least -2

DOI10.2298/AADM130710014ZzbMATH Open1313.05260MaRDI QIDQ2929892FDOQ2929892

Authors: Jiang Zhou, Lizhu Sun, Hongmei Yao, Changjiang Bu 

Publication date: 14 November 2014

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Recommendations

• On graphs whose least eigenvalue is greater than –2
• The least eigenvalue of graphs with given connectivity
• Notes on graphs with least eigenvalue at least \(-2\)
• scientific article; zbMATH DE number 5202622
• Further results on the least eigenvalue of connected graphs
• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
• On graphs with the smallest eigenvalue at least \(-1 - \sqrt 2\). II
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• Graphs with least eigenvalue \(-2\): ten years on
• scientific article

zbMATH Keywords

adjacency matrixsignless Laplacian matrixgeneralized line graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Cited In (7)

• Spanning trees and even integer eigenvalues of graphs
• Eigenvalues and clique partitions of graphs
• The enumeration of spanning tree of weighted graphs
• Line star sets for Laplacian eigenvalues
• Relationship between the rank and the matching number of a graph
• Graphs with least eigenvalue \(-2\): ten years on
• Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs

This page was built for publication: On the nullity of connected graphs with least eigenvalue at least -2

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