Eigenvalue problems of Nordhaus-Gaddum type

2005/06/13 by Vladimir Nikiforov, Nikiforov, Vladimir · 1 citation
Mathematics · #05C50 #15A42 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C50 #msc:15A42

paper · pdf · doi:10.48550/arxiv.math/0506260

arxiv created 2005/06/13 · arxiv updated 2009/12/01

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.

Cited by

• Nordhaus-Gaddum inequality for the spectral radius of a graph of order n

Related

• Nordhaus-Gaddum and other bounds for the sum of squares of the positive\n eigenvalues of a graph
• Nordhaus-Gaddum inequality for the spectral radius of a graph of order n
• Generalized Nordhaus--Gaddum Inequalities for Eigenvalues
• More eigenvalue problems of Nordhaus-Gaddum type
• Conjectured bounds for the sum of squares of positive eigenvalues of a graph