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)

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

1 Citaat (Scopus)
51 Downloads (Pure)

Samenvatting

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.

Originele taal-2Engels
Pagina's (van-tot)315-326
Aantal pagina's12
TijdschriftDiscrete Applied Mathematics
Volume340
DOI's
StatusGepubliceerd - 15 dec. 2023

Financiering

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 .

FinanciersFinanciernummer
Fonds Wetenschappelijk Onderzoek1285921N

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Bounding the sum of the largest signless Laplacian eigenvalues of a graph'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit