Linear combinations of graph eigenvalues

Details Linear combinations of graph eigenvalues Linear combinations of graph eigenvalues

2006-08-08

arxiv.org/abs/math/0608198v2

Mathematics

Combinatorics

Some calculation errors from the first version have been corrected

Scientific paper

Let F(G) be a fixed linear combination of the k extremal eigenvalues of a graph G and of its complement. The problem of finding max{F(G):v(G)=n} generalizes a number of problems raised previously in the literature. We show that the limit max{F(G):v(G)=n}/n exists when n tends to infinity. We also answer a question of Gernert about the sum of the two maximal eigenvalues of a graph.

Affiliated with

Also associated with

No associations

Rating

Linear combinations of graph eigenvalues does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear combinations of graph eigenvalues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear combinations of graph eigenvalues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248158