Walks and the spectral radius of graphs
Abstract
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
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.