| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603146 | Linear Algebra and its Applications | 2009 | 8 Pages |
Abstract
The spread of a graph is defined to be the difference between the greatest eigenvalue and the least eigenvalue of the adjacency matrix of the graph. In this paper we determine the unique graph with minimum least eigenvalue among all connected bicyclic graphs of order n. Also, we determine the unique graph with maximum spread in this class for each nâ©ľ28.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
