| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602501 | Linear Algebra and its Applications | 2009 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
