The Least Eigenvalue of Graphs
Received:August 23, 2011  Revised:February 20, 2012
Key Words: graph   complement   adjacency matrix   least eigenvalue.  
Fund Project: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) and Innovation Fund for Graduates of Anhui University.
Author NameAffiliation
Guidong YU School of Mathematical Sciences, Anhui University, Anhui 230039, P. R. China
School of Mathematics & Computation Sciences, Anqing Normal College, Anhui 246011, P. R. China 
Yizheng FAN School of Mathematical Sciences, Anhui University, Anhui 230039, P. R. China 
Yi WANG School of Mathematical Sciences, Anhui University, Anhui 230039, P. R. China 
Hits: 2991
Download times: 3462
Abstract:
      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.
Citation:
DOI:10.3770/j.issn:2095-2651.2012.06.004
View Full Text  View/Add Comment