The Least Eigenvalue of Graphs  

作　　者：Guidong YU Yizheng FAN Yi WANG 

机构地区：[1]School of Mathematical Sciences, Anhui University, Anhui 230039, P. R. China [2]School of Mathematics & Computation Sciences, Anqing Normal College, Anhui 246011, P. R. China

出　　处：《Journal of Mathematical Research with Applications》2012年第6期659-665,共7页数学研究及应用（英文版）

基　　金：Supported by National Natural Science Foundation of China (Grant No. 11071002);Program for New Century Excellent Talents in University, Key Project of Chinese Ministry of Education (Grant No. 210091);Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20103401110002);Science and Technological Fund of Anhui Province for Outstanding Youth (Grant No. 10040606Y33);the Natural Science Foundation of Department of Education of Anhui Province (Grant Nos. KJ2011A195; KJ2010B136);Project of Anhui Province for Excellent Young Talents in Universities (Grant No. 2009SQRZ017ZD);Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University (Grant No. KJJQ1001);Project for Academic Innovation Team of Anhui University (Grant No. KJTD001B);Fund for Youth Scientific Research of Anhui University (Grant No. KJQN1003);Innovation Fund for Graduates of Anhui University

摘　　要：In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.

关 键 词：GRAPH COMPLEMENT adjacency matrix least eigenvalue. 

分 类 号：O151.21[理学—数学] TP311.52[理学—基础数学]