Abstract
Let be a graph with adjacency matrix and let be the diagonal matrix of the degrees of . For every real , write for the matrix Let be the smallest for which is positive semidefinite. It is known that . The main results of this paper are: (1) if is -regular then where is the smallest eigenvalue of ; (2) contains a bipartite component if and only if ; (3) if is -colorable, then .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.