完美匹配树谱半径的进一步排序  

Further Ordering Trees with Perfect Matchings by Their Spectral Radius

作　　者：陈小丹[1] 

机构地区：[1]厦门大学数学科学学院,福建厦门361005

出　　处：《厦门大学学报（自然科学版）》2013年第3期297-301,共5页Journal of Xiamen University：Natural Science

基　　金：广西壮族自治区教育厅科研项目(201106LX460)

摘　　要：用图的谱对图进行分类和排序是图谱理论的研究方向之一.主要研究了完美匹配树依谱半径排序的问题.事实上,到目前为止,具有前七大谱半径的完美匹配树已经排出,且具有第八大至第二十大谱半径的完美匹配树的范围也已经确定,但它们之间的大小顺序还没有具体给出.借助图的移接变形和图的特征多项式等工具,完整地解决了这一问题,具体排出了具有第八大至第二十大谱半径的完美匹配树.One of the main research topics in spectral graph theory is classifying or ordering graphs by their spectra. In this paper,or- dering trees with perfect matchings by their spectral radius are mainly concerned. In fact, up to now, the first 7th largest trees with perfect matchings according to their spectral radius have been ordered. However, the 8th to 20th largest trees with perfect matchings according to their spectral radius are not completely ordered. By means of the transformations and the characteristic polynomials of graphs,we completely determine the 8th to 20th largest trees with perfect matchings according to their spectral radius.

关 键 词：树 完美匹配 谱半径 排序 

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