Linear combinations of graph eigenvalues
| dc.creator | Nikiforov, Vladimir | |
| dc.date | 2006-08-08 | |
| dc.date | 2006-10-02 | |
| dc.date.accessioned | 2026-07-07T07:21:32Z | |
| dc.date.available | 2026-07-07T07:21:32Z | |
| dc.description | 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. | |
| dc.description | Some calculation errors from the first version have been corrected | |
| dc.identifier | https://arxiv.org/abs/math/0608198 | |
| dc.identifier | http://arxiv.org/abs/math/0608198 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115329 | |
| dc.subject | Combinatorics | |
| dc.subject | Commutative Algebra | |
| dc.subject | 05C50 | |
| dc.title | Linear combinations of graph eigenvalues | |
| dc.type | text |