| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603150 | Linear Algebra and its Applications | 2009 | 5 Pages |
Abstract
Let G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are those of A(G). In this paper, we characterize the graphs with the minimal least eigenvalue among all graphs of fixed order with given vertex connectivity or edge connectivity.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
