Home

Bipartite subgraphs and the smallest eigenvalue


Author(s) : Benny Sudakov Noga Alon, 
Publisher : N/A
Publication Date : 2000
ISSN : N/A
Abstract : Two results dealing with the relation between the smallest eigenvalue of a graph and its bipartite subgraphs are obtained. The first result is that the smallest eigenvalue of any nonbipartite graph on n vertices with diameter D and maximum degree \Delta satisfies \Gamma\Delta + 1,