Bounds on graph eigenvalues II
Abstract
Some recent results on graph eigenvalues are improved. In particular, among all graphs of given order with no cliques of order (r+1) the r-partite Turan graph has maximal spectral radius.
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.