Algebraic Graph Theory: Minimum eigenvalue of nonbipartite graphs

Talk by Bojan Mohar.

Let ρ and λ be the largest and the smallest eigenvalue of a connected graph G. It is well-known that ρ + λ is non-negative, and that it is equal if and only if G is bipartite. The speaker will discuss what else can we say when G is not bipartite.