Back to Search
Start Over
The signed graphs with all but at most three eigenvalues equal to −1.
- Source :
-
Linear Algebra & its Applications . May2023, Vol. 664, p314-323. 10p. - Publication Year :
- 2023
-
Abstract
- The eigenvalues of a signed graph are the eigenvalues of its adjacency matrix. In this paper, we completely characterize the signed graphs for which the adjacency matrices have at most three eigenvalues unequal to −1. [ABSTRACT FROM AUTHOR]
- Subjects :
- *EIGENVALUES
*MATRICES (Mathematics)
Subjects
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 664
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 162026941
- Full Text :
- https://doi.org/10.1016/j.laa.2023.01.021