On the Least Eigenvalue of Graphs with Cut Vertices
Received:November 09, 2008  Revised:May 22, 2009
Key Words: adjacency matrix   least eigenvalue   minimizing graph   cut vertex.  
Fund Project:Supported by the National Natural Science Foundation of China (Grant No.11071002), Key Project of Chinese Ministry of Education (Grant No.210091), Anhui Provincial Natural Science Foundation (Grant No.10040606Y33), Anhui University Innovation Team Project (Grant No.KJTD001B), Project of Anhui Province for Young Teachers Research Support in Universities (Grant No.2008JQl021), Project of Anhui Province for Excellent Young Talents in Universities (Grant No.2009SQRZ017ZD) and the Natural Science Foundation of Department of Education of Anhui Province (Grant No.KJ2010B136).
Author NameAffiliation
Yi WANG School of Mathematical Sciences, Anhui University, Anhui 230039, P. R. China 
Yun QIAO School of Mathematical Sciences, Anhui University, Anhui 230039, P. R. China 
Yi Zheng FAN School of Mathematical Sciences, Anhui University, Anhui 230039, P. R. China 
Hits: 3471
Download times: 2904
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2010.06.001
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.