Geodesic
The Laplacian spread of tricyclic graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we investigate Laplacian spread of graphs, and prove that there exist exactly five types of tricyclic graphs with maximum Laplacian spread among all tricyclic graphs of fixed order.
DOI : 10.37236/169
Classification : 05C50, 15A18
Mots-clés : Laplacian matrix of a graph 
@article{10_37236_169,
     author = {Yanqing Chen and Ligong Wang},
     title = {The {Laplacian} spread of tricyclic graphs},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/169},
     zbl = {1230.05198},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/169/}
}
TY  - JOUR
AU  - Yanqing Chen
AU  - Ligong Wang
TI  - The Laplacian spread of tricyclic graphs
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/169/
DO  - 10.37236/169
ID  - 10_37236_169
ER  - 
%0 Journal Article
%A Yanqing Chen
%A Ligong Wang
%T The Laplacian spread of tricyclic graphs
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/169/
%R 10.37236/169
%F 10_37236_169
Yanqing Chen; Ligong Wang. The Laplacian spread of tricyclic graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/169

Cité par Sources :