Back to Search
Start Over
The least eigenvalue of graphs whose complements have only two pendent vertices.
- Source :
-
Applied Mathematics & Computation . Aug2018, Vol. 331, p112-119. 8p. - Publication Year :
- 2018
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *EIGENVALUES
*EIGENVECTORS
*LAPLACIAN matrices
*MATHEMATICAL inequalities
*INTEGERS
Subjects
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 331
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 128956188
- Full Text :
- https://doi.org/10.1016/j.amc.2018.02.048