| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4601586 | Linear Algebra and its Applications | 2011 | 11 Pages |
Abstract
A tricyclic graph of order n is a connected graph with n vertices and n + 2 edges. In this paper, all tricyclic graphs whose second largest eigenvalue does not exceed 1 are identified.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
