Graph combinatorial invariants and the distribution of the signless Laplacian eigenvalues: known and new results

Vol 57, 2025 - 340650
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract

Let $G$ be a simple graph of order $n$ and let $Q(G)$ denote its signless Laplacian matrix. Motivated by recent studies on the distribution of the eigenvalues of $Q(G)$ within subintervals of $[0,\,2n-2]$, we investigate connections between spectral properties and structural graph parameters. We first review relevant results from the literature and establish auxiliary lemmas. Our main contribution is a lower bound for the number of eigenvalues of $Q(G)$ in the interval $[1,\,2n-2]$ in terms of the edge covering number for graphs without isolated vertices. In addition, we determine the exact value of $m_{Q(C_n)}(1,\,2n-2]$ for cycles, expressing it in terms of the domination number. These results provide new insights into the interplay between the signless Laplacian spectrum and classical graph invariants.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal do Paraná
Track
  • TAG – Graph Theory and Related Algorithms
Keywords
Signless Laplacian eigenvalue distribution
Edge covering number
Domination number