首页 | 本学科首页   官方微博 | 高级检索  
     

完美匹配树的次大和次小的最大特征值
引用本文:常安. 完美匹配树的次大和次小的最大特征值[J]. 高校应用数学学报(A辑), 1999, 14(4): 397-403
作者姓名:常安
作者单位:福州市福州大学数学系,350002
基金项目:福建省教委自然科学基金
摘    要:本文讨论完美匹配树的次大和次小的最大特征值问题,得到了次大的最大特征值的上界的明确表达式并确定了达到此上界的极树,同时也得到了次小的最大特征值的下界并确定了相应的极树。

关 键 词:完美匹配树  特征多项式  特征值  

Sub-large Value and Quasi-small Value of the Largest Eigenvalue of the Trees with Perfect Matchings
Chang An. Sub-large Value and Quasi-small Value of the Largest Eigenvalue of the Trees with Perfect Matchings[J]. Applied Mathematics A Journal of Chinese Universities, 1999, 14(4): 397-403
Authors:Chang An
Abstract: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.
Keywords:Trees with Perfect Matchings   Characteristic Polynomial   Eigenvalues   Bounds
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号