摘要
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.
| 源语言 | 英语 |
|---|---|
| 文章编号 | R80 |
| 期刊 | Electronic Journal of Combinatorics |
| 卷 | 16 |
| 期 | 1 |
| DOI | |
| 出版状态 | 已出版 - 2 7月 2009 |