Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900977 | Applied Mathematics and Computation | 2018 | 8 Pages |
Abstract
Let G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of A(G) are referred to as the eigenvalues of G. In this paper, we characterize the graphs with the minimal least eigenvalue among all graphs whose complements are connected and have only two pendent vertices.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Guisheng Jiang, Guidong Yu, Wei Sun, Zheng Ruan,