The Laplacian spectral radius of tricyclic graphs with n vertices and k pendant vertices

Tricyclic graphs are connected graphs in which the number of edges equals the number of vertices plus two. In this paper, we determine the graph with the largest Laplacian spectral radius among all tricyclic graphs with n vertices and k pendant vertices.