Bounding the sum of the largest signless Laplacian eigenvalues of a graph

Aida Abiad, Leonardo de Lima, Sina Kalantarzadeh, Mona Mohammadi, Carla Oliveira (Corresponding author)

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
52 Downloads (Pure)

Abstract

We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.

Original languageEnglish
Pages (from-to)315-326
Number of pages12
JournalDiscrete Applied Mathematics
Volume340
DOIs
Publication statusPublished - 15 Dec 2023

Funding

The research of Aida Abiad is partially supported by the FWO, Belgium grant 1285921N . Leonardo de Lima has been supported by CNPq, Brazil Grant 315739/2021-5 , and Carla Oliveira has also been supported by CNPq, Brazil Grant 30458/2020-0 . The authors thank Ali Mohammadian for his valuable comments on Section 3 .

FundersFunder number
Fonds Wetenschappelijk Onderzoek1285921N

    Keywords

    • Interlacing
    • Signless Laplacian matrix
    • Sum of eigenvalues

    Fingerprint

    Dive into the research topics of 'Bounding the sum of the largest signless Laplacian eigenvalues of a graph'. Together they form a unique fingerprint.

    Cite this