Improved upper bounds for the Laplacian spectral radius of a graph
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl EuDML
In this paper, we present three improved upper bounds for the Laplacian spectral radius of graphs. Moreover, we determine all extremal graphs which achieve these upper bounds. Finally, some examples illustrate that the results are best in all known upper bounds in some sense.
Tianfei Wang; Jin Yang; Bin Li. Improved upper bounds for the Laplacian spectral radius of a graph. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/522
@article{10_37236_522,
author = {Tianfei Wang and Jin Yang and Bin Li},
title = {Improved upper bounds for the {Laplacian} spectral radius of a graph},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/522},
zbl = {1205.05154},
url = {http://geodesic.mathdoc.fr/articles/10.37236/522/}
}
Cité par Sources :