|
|||||
|
|
Minimal least eigenvalue of connected graphs of order n and size m = n + k (5≤k≤8) |
|
| Authors: | Xin LI Jiming GUO Zhiwen WANG |
| Institution: | Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China |
| Abstract: | 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. |
| Keywords: | Least eigenvalue adjacency matrix graph |
| 点击此处可从《Frontiers of Mathematics in China》浏览原始摘要信息 | |
| 点击此处可从《Frontiers of Mathematics in China》下载免费的PDF全文 | |