完美匹配树的次大和次小的最大特征值  

SUB\|LARGE VALUE AND QUASI\|SMALL VALUE OF THE LARGEST EIGENVALUE OF THE TREES WITH PERFECT MATCHINGS

作　　者：常安[1] 

机构地区：[1]福州大学数学系,350002

出　　处：《高校应用数学学报（A辑）》1999年第4期397-403,共7页Applied Mathematics A Journal of Chinese Universities(Ser.A)

基　　金：福建省教委自然科学基金

摘　　要：本文讨论完美匹配树的次大和次小的最大特征值问题，得到了次大的最大特征值的上界的明确表达式并确定了达到此上界的极树。In this paper,the problem on the sub\|large value and the quasi\|small value of the largest eigenvalue of the trees with perfect matchings is studied.The explicit expression of the upper bound of the sub\|large value of the largest eigenvalue is given and the extreme tree which reachs this upper bound is determined.The lower bound of the quasi\|small value of the largest eigenvalue of this kind of tree is obatined and the corresponding extreme tree is determined.

关 键 词：完美匹配树 特征多项式 特征值 界 最大特征值 

分 类 号：O157.5[理学—数学]