| 当匹配数很小时具有最小拉普拉斯谱半径的树 |
| |
| 引用本文： | 林西芹,冯立华,于桂海.当匹配数很小时具有最小拉普拉斯谱半径的树[J].浙江大学学报(理学版),2013,40(5):494-498. |
| |
| 作者姓名： | 林西芹 冯立华 于桂海 |
| |
| 作者单位： | 1. 山东工商学院数学学院,山东烟台,264005
2. 中南大学数学与统计学院,湖南长沙,410075 |
| |
| 基金项目： | Foundation item:Supported by Natural Science Foundation of China，Science Foundation of Shandong，Shandong Institute of Business and Technology Foundation |
| |
| 摘 要： | 考虑了具有最小拉普拉斯谱半径的树的问题. 并确定了当匹配数很小时具有最小拉普拉斯谱半径的树.
|
| 关 键 词： | 树 拉普拉斯谱半径 匹配数 |
| 收稿时间： | 2012-06-04 |
Trees with small matching number and minimum Laplacian spectral radius |
| |
| LIN Xi-qin
,
FENG Li-hua
,
YU Gui-hai.Trees with small matching number and minimum Laplacian spectral radius[J].Journal of Zhejiang University(Sciences Edition),2013,40(5):494-498. |
| |
| Authors: | LIN Xi-qin FENG Li-hua YU Gui-hai |
| |
| Affiliation: | 1. School of Mathematics, Shandong Institute of Business and Technology, Yantai 264005, Shandong Province, China; 2. Department of Mathematics, Central South University, Changsha 410075, China) |
| |
| Abstract: | The minimal Laplacian spectral radiuses of trees and minimum Laplacian spectral radius are determined. are treated, and the trees with small matching number |
| |
| Keywords: | trees Laplacian spectral radius matching number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息 |
|
点击此处可从《浙江大学学报(理学版)》下载全文 |
