login/create account
The sum of the two largest eigenvalues (Solved)
be a graph on
vertices and let
be the eigenvalues of
. Is
? This property does hold for all regular graphs
. If
is
-regular, then
. Further, if we let
denote the complement of
and let
denote its eigenvalues, then
(the second inequality here follows from the observation that
is
-regular).
Bibliography
Open Problems in Spectral Graph Theory (a list maintained by Dragan Stevanović).
* indicates original appearance(s) of problem.
Is this really solved?
I'm confused how the paper's result (which you have posted) solves this question. I didn't read the paper, but the abstract only gave a looser bound that the sum of the first two eigenvalues is <= 2/sqrt(3) * n (and not just n).
a negative solution
The paper shows that the sum of the first two eigenvalues exceeds 1.125n - 25, so exceeds n when n is sufficiently large. Thus Nikiforov has given a negative solution to the problem. (Note: I have not checked the claims of the paper thoroughly.)
Drupal
IRMACS
Solved!
About 5 months ago, I was shown a counterexample to this conjecture by Bojan Mohar (I believe in joint work with two of his grad. students - Javad Ebrahimi and Azhvan Sheikh). However, thanks to Gordon Royle, I have just learned that this problem was resolved earlier by Vladimir Nikiforov. See Linear combinations of graph eigenvalues.