Distribution of signless Laplacian eigenvalues and degree sequence
Abstract
Let G be a graph of order n with degree sequence d1 ≥ ·s ≥ dn. Let mGI be the number of signless Laplacian eigenvalues in an interval I. In this paper, we characterize the distribution of the signless Laplacian eigenvalues in terms of the degree sequence of a graph within specific subintervals of [0, \, 2n-2]. We determine all graphs G such that mG[dn, 2n-2] ≤ 2, \; mG[dn-1, 2n-2] = 1, \; mG[0, d1] 2. We also prove that there is no graph such that mG[0, d3]=1. In addition, we obtain all disconnected graphs such that mG[0, d1] = 3. Finally, we propose two open problems for future research.
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.