Let ψ be a certain set of graphs.A graph is called a minimizing graph in the set ψ if its least eigenvalue attains the minimum among all graphs in ψ.In this paper,we determine the unique minimizing graph in ψn,whe...Let ψ be a certain set of graphs.A graph is called a minimizing graph in the set ψ if its least eigenvalue attains the minimum among all graphs in ψ.In this paper,we determine the unique minimizing graph in ψn,where ψn denotes the set of connected graphs of order n with cut vertices.展开更多
基金Supported by the Supported by the National Natural Science Foundation of China (Grant No. 11071002)Key Project of Chinese Ministry of Education (Grant No. 210091)+4 种基金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)the Natural Science Foundation of Department of Education of Anhui Province (Grant No. KJ2010B136)
文摘Let ψ be a certain set of graphs.A graph is called a minimizing graph in the set ψ if its least eigenvalue attains the minimum among all graphs in ψ.In this paper,we determine the unique minimizing graph in ψn,where ψn denotes the set of connected graphs of order n with cut vertices.