Eigenvalue problems of Nordhaus-Gaddum type
Vladimir Nikiforov

TL;DR
This paper extends Nordhaus-Gaddum type bounds from spectral radii to other eigenvalues of graphs, providing new bounds and solving the problem for second eigenvalues.
Contribution
It generalizes existing bounds to a broader set of eigenvalues and offers solutions specifically for the second eigenvalues of graphs.
Findings
Derived bounds for eigenvalues of graphs and their complements.
Solved the problem for the second eigenvalues.
Extended Nordhaus-Gaddum inequalities to new spectral parameters.
Abstract
In 1970 Nosal gave upper and lower bounds on the sum of the spectral radii of a graph and its complement. We generalize this problem to other eigenvalues and give a number of bounds. We essentially solve the corresponding problem for the second eigenvalues.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Mathematical Inequalities and Applications
