【摘要】 对于一个图的集合Ψ,若图G是Ψ中所有图的最小特征值达到最小的那个图,则称G是集合Ψ中最小特征值的极小图。文章刻画了直径为n-2的n阶连通图最小特征值及其极小图。更多还原

【Abstract】 Let Y be a certain set of graphs.A graph G is called a minimizing graph in the set Y if its least eigenvalue attains the minimum among all graph in Y.In this paper,we characterize the minimizing graph among all graphs of order n with diameter.更多还原