Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) (Q2175476)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimal least eigenvalue of connected graphs of order n and size m = n + k (5 k 8) |
scientific article; zbMATH DE number 7194850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) |
scientific article; zbMATH DE number 7194850 |
Statements
Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) (English)
0 references
29 April 2020
0 references
least eigenvalue
0 references
adjacency matrix
0 references
0 references
0.8939514
0 references
0.8875811
0 references
0 references
0.8743357
0 references
0.8727156
0 references
0.8717832
0 references
0 references
0.8701577
0 references
0.8687758
0 references
