| m重似星树的谱半径 |
| |
| 引用本文： | 吴廷增,扈生彪.m重似星树的谱半径[J].运筹学学报,2011,15(3):45-50. |
| |
| 作者姓名： | 吴廷增 扈生彪 |
| |
| 作者单位： | 青海民族大学数学与统计学院,青海西宁,810007 |
| |
| 基金项目： | National Natural Science Foundation of China(10861009); National commission of ethnic affairs research projects(10QH01) |
| |
| 摘 要： | 仅有一个顶点的度大于2的树称为似星树.在一棵似星树的每个一度点粘接一棵似星树构成的图称为m重似星树.Gutman和L.Shi给出了似星树谱半径的一个界.在本文中我们给出了另外一个更简洁的证明方法并做了深入的讨论,同时给出了m重似星树谱半径的一个最好界.
|
| 关 键 词： | m重似星树 图的谱 谱半径 |
On the Spectral Radii of m-Starlike Tree |
| |
| WU Tingzeng,HU Shengbiao.On the Spectral Radii of m-Starlike Tree[J].OR Transactions,2011,15(3):45-50. |
| |
| Authors: | WU Tingzeng HU Shengbiao |
| |
| Institution: | WU Tingzeng HU Shengbiao School of Mathematics and Statistics,Qinghai Nationalities University,Xining 810007,China |
| |
| Abstract: | A tree is said to be starlike if exactly one of its vertices has degree larger than 2.A m-starlike tree is obtained by appending a starlike tree to every one terminus of a starlike tree S0 =S(m01,m02,...,m0△0).Gutman and L.Shi give a bound of the spectral radii of starlike tree.In this paper,we give an another short proof and further discussions about this result.Sometime,we give a new upper bound of the spectral radii of m-starlike tree. |
| |
| Keywords: | m-Starlike tree Spectra of graphs Spectral radius |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
| 点击此处可从《运筹学学报》下载免费的PDF全文 |
