New Bounds for the Signless Laplacian Spread
Spectral Theory
2018-05-31 v1 Combinatorics
Abstract
Let be a simple graph. The signless Laplacian spread of is defined as the maximum distance of pairs of its signless Laplacian eigenvalues. This paper establishes some new bounds, both lower and upper, for the signless Laplacian spread. Several of these bounds depend on invariant parameters of the graph. We also use a minmax principle to find several lower bounds for this spectral invariant.
Cite
@article{arxiv.1805.11803,
title = {New Bounds for the Signless Laplacian Spread},
author = {Enide Andrade and Geir Dahl and Laura Leal and María Robbiano},
journal= {arXiv preprint arXiv:1805.11803},
year = {2018}
}