Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4602528 | Linear Algebra and its Applications | 2008 | 12 Pages |
Abstract
The spread of a graph is defined to be the difference between the largest eigenvalue and the least eigenvalue of the adjacency matrix of the graph. Let denote the set of connected unicyclic graphs of order n and girth k, and let Un denote the set of connected unicyclic graphs of order n. In this paper, we determine the unique graph with minimum least eigenvalue (respectively, the unique graph with maximum spread) among all graphs in . We, finally, characterize the unique graph with minimum least eigenvalue (respectively, the unique graph with maximum spread) among all graphs in Un.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory