Geodesic
Improved upper bounds for the Laplacian spectral radius of a graph
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/522
Classification : 05C50, 15A18 
@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/}
}
TY  - JOUR
AU  - Tianfei Wang
AU  - Jin Yang
AU  - Bin Li
TI  - Improved upper bounds for the Laplacian spectral radius of a graph
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/522/
DO  - 10.37236/522
ID  - 10_37236_522
ER  - 
%0 Journal Article
%A Tianfei Wang
%A Jin Yang
%A Bin Li
%T Improved upper bounds for the Laplacian spectral radius of a graph
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/522/
%R 10.37236/522
%F 10_37236_522
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

Cité par Sources :