Laplacian eigenvalue distribution for unicyclic graphs
Abstract
Let G be a unicyclic graph. In this paper, we provide an upper bound for the number of Laplacian eigenvalues of G within the interval [0,1) in terms of the diameter and the girth of G.
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.