Minimal least eigenvalue of connected graphs of order n and size m=n+k(5 ≤k≤8)

• 作 者: Xin LI Jiming GUO Zhiwen WANG
• 机 构: Department of Mathematics, East China University of Science and Technology,Shanghai 200237, China
• 出 处: 中国数学前沿
• 发表日期: 2019年6期
• 关键词: Least eigenvalue adjacency matrix graph

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.