On graphs with exactly one eigenvalue less than -1 (Q1118615): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(91)90096-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W70136917 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3672019 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recent results in the theory of graph spectra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On subdominantly bounded graphs — Summary of results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discrete hyperbolic geometry / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3337502 / rank | |||
Normal rank | |||
Latest revision as of 13:53, 19 June 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
