Back to Search
Start Over
Mixed graphs with smallest eigenvalue greater than [formula omitted].
- Source :
-
Linear Algebra & its Applications . Feb2022, Vol. 635, p95-115. 21p. - Publication Year :
- 2022
-
Abstract
- In this paper, we determine the underlying graphs of the mixed graphs with smallest Hermitian eigenvalue greater than − 3. Furthermore, we characterize all mixed graphs on n ≥ 11 vertices with smallest Hermitian eigenvalue greater than − 3. The mixed graphs on n ≤ 10 vertices with smallest Hermitian eigenvalue greater than − 3 could be also obtained easily with the help of computer because their underlying graphs are determined. Roughly speaking, we completely determine the mixed graphs with smallest Hermitian eigenvalue greater than − 3. [ABSTRACT FROM AUTHOR]
- Subjects :
- *EIGENVALUES
*REGULAR graphs
*COMPUTERS
Subjects
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 635
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 154244132
- Full Text :
- https://doi.org/10.1016/j.laa.2021.11.009