Nordhaus-Gaddum inequality for the spectral radius of a graph of order n
Abstract
We determine the extremal graph G of order n that maximizes the sum of the spectral radii of G and its complement. This resolves a conjecture posed by Stevanovi\'c in 2007.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.