On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\) (Q1899436)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 803762
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\) |
scientific article; zbMATH DE number 803762 |
Statements
On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\) (English)
0 references
26 October 1995
0 references
This paper shows that if the smallest eigenvalue of a graph \(H\) exceeds a fixed number larger than the smallest root \((\approx- 2.4812)\) of the polynomial \(x^3+ 2x^2- 2x- 2\), and if every vertex of \(H\) has sufficiently large valency, then the smallest eigenvalue of \(H\) is at least \(-1-\sqrt 2\) and the structure of \(H\) is completely characterized through a new generalization of line graphs.
0 references
smallest eigenvalue
0 references
line graphs
0 references
0.8875744342803955
0 references
0.8619667887687683
0 references
0.8497669100761414
0 references
0.8468931913375854
0 references
0.8439693450927734
0 references
