Home » Author index

Gernert, Dieter


Graph Theory » Algebraic G.T.

The sum of the two largest eigenvalues ★★

Author(s): Gernert

Problem   Let $ G $ be a graph on $ n $ vertices and let $ \lambda_1 \ge \lambda_2 \ge \ldots \ge \lambda_n $ be the eigenvalues of $ G $. Is $ \lambda_1 + \lambda_2 \le n $?

Keywords: eigenvalues; spectrum

Posted by mdevos
updated January 13th, 2009
4 comments
Syndicate content