Ordering graphs with given size by their signless Laplacian spectral radii (Q2082377)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ordering graphs with given size by their signless Laplacian spectral radii |
scientific article |
Statements
Ordering graphs with given size by their signless Laplacian spectral radii (English)
0 references
4 October 2022
0 references
The authors of this paper investigate the signless Laplacian spectral radius \(q(G)\) of a graph \(G\). They first give an upper bound on \(q(G)\) with fixed size and maximum degree. Further, applying this upper bound, they order graphs by their signless Laplacian spectral radii with respect to the maximum degree. As an application, the first \(\lfloor d/2 \rfloor\) graphs with the largest signless Laplacian spectral radius among all graphs with fixed size and diameter \(d\) are determined.
0 references
signless Laplacian spectral radius
0 references
size
0 references
upper bound
0 references
ordering
0 references
diameter
0 references
0 references