MAXIMIZING THE LAPLACIAN SPREAD FOR TRICYCLIC GRAPHS WITH SMALL ORDER
ABSTRACT
The difference between the largest eigenvalue and the second smallest eigenvalue is defined to be the Laplacian spread of . In this paper, we mainly study the largest Laplacian spread amomg all simple tricyclic graphs with order . Then we get the result that the graph which has the largest Laplacian spread, among all tricyclic graphs with order at least 6, must be the graph attained from by adding three edges between any two pendents.