The Moore bound for Spectral Radius
Abstract
We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.
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.