Any graph on n vertices satisfies λ1(G) + λ2(G) ≤ (8/7)n.
On the sum of k largest eigenvalues of graphs and symmetric matrices.J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
math.CO 1years
2026 1verdicts
ACCEPT 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Maximum spectral sum of graphs
Any graph on n vertices satisfies λ1(G) + λ2(G) ≤ (8/7)n.