pith. sign in

arxiv: 2605.27405 · v1 · pith:Z4DRBLGSnew · submitted 2026-05-04 · 🧮 math.CO · math.SP

Distribution of signless Laplacian eigenvalues and degree sequence

classification 🧮 math.CO math.SP
keywords degreeeigenvaluesgraphlaplaciansequencesignlessdistributiongraphs
0
0 comments X
read the original abstract

Let $G$ be a graph of order $n$ with degree sequence $d_1 \geq \cdots \geq d_{n}$. Let $m_{G}I$ 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 $m_{G}[d_n, 2n-2] \leq 2, \; m_{G}[d_{n-1}, 2n-2] = 1, \; m_{G}[0, d_1] \le 2.$ We also prove that there is no graph such that $m_{G}[0, d_3]=1$. In addition, we obtain all disconnected graphs such that $m_{G}[0, d_1] = 3$. Finally, we propose two open problems for future research.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.