论文部分内容阅读
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