Abstract
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.
| Original language | English |
|---|---|
| Article number | R80 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 16 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2 Jul 2009 |