匹配数为2的图的最小特征值(英文)  

On The Least Eigenvalue of Graphs with Matching Number Two

作　　者：洪振木[1] 汪毅[1] 范益政[1] 

机构地区：[1]安徽大学数学科学学院,安徽合肥230039

出　　处：《数学研究》2010年第4期335-341,共7页Journal of Mathematical Study

基　　金：Supported by National Natural Science Foundation of China(10601001);Anhui Provincial Natural Science Foundation(070412065);Project of Anhui Province for Young Teachers Research Support in University(2008jq1021,2008jq1083);Project of Anhui Province for Excellent Young Talent in University(2009SQRZ017ZD);Project of Anhui University on leading Researchers Construction

摘　　要：在所有给定阶数且匹配数为2的连通图中,我们刻画了最小特征值达到极小的图,给出了这类图最小特征值的下界.In this paper,we characterize the unique graph whose least eigenvalue attains the minimum among all connected graphs with fixed order and matching number two.

关 键 词：邻接矩阵 最小特征值 匹配数 

分 类 号：O151.21[理学—数学]