| 直径为n-4的图的最小无号拉普拉斯谱半径 |
| |
| 引用本文： | 吴晓丽,姜静静,郭继明,谭尚旺.直径为n-4的图的最小无号拉普拉斯谱半径[J].数学学报,2011(4). |
| |
| 作者姓名： | 吴晓丽 姜静静 郭继明 谭尚旺 |
| |
| 作者单位： | 中国石油大学(华东)数学与计算科学学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(10871024); 中央高校基本科研业务费专项资金(09CX04003A) |
| |
| 摘 要： | Liu Lu和Shu等在The minimal Lapacian spectral radius of trees with a given diameter,Theoretical Computer Science,2009,410:78-83]中分别给出了直径为{1,2,3,4,n-3,n-2,n-1}的具有最小拉普拉斯谱半径的树.本文给出了直径为n-4的具有最小无号拉普拉斯谱半径的图.作为推论,给出了直径为n-4的具有最小拉普拉斯谱半径的村.
|
| 关 键 词： | 无号拉普拉斯谱半径 拉普拉斯谱半径 拉普拉斯特征多项式 |
The Minimal Signless Lapacian Spectral Radius of Graphs with Diameter n-4 |
| |
| Xiao Li WU Jing Jing JIANG Ji Ming GUO Shang Wang TAN.The Minimal Signless Lapacian Spectral Radius of Graphs with Diameter n-4[J].Acta Mathematica Sinica,2011(4). |
| |
| Authors: | Xiao Li WU Jing Jing JIANG Ji Ming GUO Shang Wang TAN |
| |
| Institution: | Xiao Li WU Jing Jing JIANG Ji Ming GUO Shang Wang TAN Department of Applied Mathematics,China University of Petroleum,Dongying 257061,P.R.China |
| |
| Abstract: | In the paperThe minimal Lapacian spectral radius of trees with a given diameter,Theoretical Computer Science,2009,410:78-83],Liu,Lu and Shu(2009) determine the trees with minimal Lapacian spectral radii for the diameter belongs to {l,2,3,4,n-3,n-2,n-1},respectively.This paper gives the unique graph with minimal signless Lapacian spectral radius among graphs with diameter n-4.Furthermore as a corollary,we determine the tree with minimal Lapacian spectral radius among trees with diameter n-4. |
| |
| Keywords: | signless Lapacian spectral radius Lapacian spectral radius Lapacian characteristic polynomial |
| 本文献已被 CNKI 等数据库收录！ |
|
