On graphs with exactly one eigenvalue less than -1 (Q1118615): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 03:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On graphs with exactly one eigenvalue less than -1 |
scientific article |
Statements
On graphs with exactly one eigenvalue less than -1 (English)
0 references
1991
0 references
In this paper all connected bipartite graphs whose second largest eigenvalue does not exceed 1 and all connected graphs with exactly one eigenvalue less than -1 are characterized. Besides, all minimal graphs with exactly two eigenvalues less than -1 are determined.
0 references
C-canonical graph
0 references
bipartite graphs
0 references
eigenvalue
0 references
minimal graphs
0 references
