Asymptotic conjecture for the spectral Nordhaus–Gaddum function
Asymptotic conjecture for the spectral Nordhaus–Gaddum function
Let denote the spectral Nordhaus–Gaddum function defined in the paper for graphs of order . Asymptotic conjecture for .
The preceding construction gives the lower bound , while the paper notes that the available upper bound is far from best; the conjecture predicts the correct asymptotic growth up to an additive constant.
Sources & referencesView supporting material
Primary source
Vladimir Nikiforov, “Eigenvalue problems of Nordhaus-Gaddum type”, arXiv:math/0506260 (2005).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.