Minimal least eigenvalue of connected graphs of order n and size m = n + k (5≤k≤8)
Xin LI , Jiming GUO , Zhiwen WANG
Front. Math. China ›› 2019, Vol. 14 ›› Issue (6) : 1213 -1230.
Minimal least eigenvalue of connected graphs of order n and size m = n + k (5≤k≤8)
The least eigenvalue of a connected graph is the least eigenvalue of its adjacency matrix. We characterize the connected graphs of order n and size n + k (5≤k≤8 and n>k + 5) with the minimal least eigenvalue.
Least eigenvalue / adjacency matrix / graph
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature
/
| 〈 |
|
〉 |