Bounding the sum of the largest signless Laplacian eigenvalues of a graph
Combinatorics
2022-10-10 v1
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.
Cite
@article{arxiv.2210.03635,
title = {Bounding the sum of the largest signless Laplacian eigenvalues of a graph},
author = {Aida Abiad and Leonardo de Lima and Sina Kalantarzadeh and Mona Mohammadi and Carla Oliveira},
journal= {arXiv preprint arXiv:2210.03635},
year = {2022}
}
Comments
arXiv admin note: text overlap with arXiv:1412.0323