Bounding the sum of the largest signless Laplacian eigenvalues of a graph
Discrete Applied Mathematics · 2023-12 · 340 · 315-326
DOI: 10.1016/j.dam.2023.07.016 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2023-12. Verfasst von Aida Abiad und 4 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 20 Literaturangaben. Gefördert von: Fonds Wetenschappelijk Onderzoek, Conselho Nacional de Desenvolvimento Científico e Tecnológico.
Abstract (Originalsprache)
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.
Förderung
- Fonds Wetenschappelijk Onderzoek
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
Zitieren
APA
Abiad, A., Lima, L. D., Kalantarzadeh, S., Mohammadi, M., & Oliveira, C. (2023). Bounding the sum of the largest signless Laplacian eigenvalues of a graph. Discrete Applied Mathematics, 340, 315-326. https://doi.org/10.1016/j.dam.2023.07.016
Vancouver
Abiad A, Lima LD, Kalantarzadeh S, Mohammadi M, Oliveira C. Bounding the sum of the largest signless Laplacian eigenvalues of a graph. Discrete Applied Mathematics. 2023;340:315-326. doi:10.1016/j.dam.2023.07.016
BibTeX
@article{Abiad2023,
author = {Abiad, Aida and Lima, Leonardo de and Kalantarzadeh, Sina and Mohammadi, Mona and Oliveira, Carla},
title = {Bounding the sum of the largest signless Laplacian eigenvalues of a graph},
journal = {Discrete Applied Mathematics},
year = {2023},
volume = {340},
pages = {315--326},
doi = {10.1016/j.dam.2023.07.016}
}
EUVIMED