m重似星树的谱半径

运筹学学报 ›› 2011, Vol. 15 ›› Issue (3): 45-50.

m重似星树的谱半径

吴廷增, 扈生彪

出版日期:2011-09-20 发布日期:2011-09-20

On the Spectral Radii of m-Starlike Tree

WU Ting-Zeng, HU Sheng-Biao

Online:2011-09-20 Published:2011-09-20

摘要/Abstract

摘要： 仅有一个顶点的度大于2的树称为似星树.
在一棵似星树的每个一度点粘接一棵似星树构成的图称为$m$重似星树.
Gutman 和L. Shi给出了似星树谱半径的一个界.
在本文中我们给出了另外一个更简洁的证明方法并做了深入的讨论,
同时给出了$m$重似星树谱半径的一个最好界.

关键词: m重似星树, 图的谱, 谱半径

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 $S_{0}=S(m_{01}, m_{02}, ...
,m_{0\Delta_{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.

Key words: m-Starlike tree, , Spectra of graphs, Spectral radius

吴廷增, 扈生彪. m重似星树的谱半径[J]. 运筹学学报, 2011, 15(3): 45-50.

WU Ting-Zeng, HU Sheng-Biao. On the Spectral Radii of m-Starlike Tree[J]. Operations Research Transactions, 2011, 15(3): 45-50.

[1]	陈媛媛, 王国平. 三圈图的无符号拉普拉斯谱半径[J]. 运筹学学报, 2019, 23(1): 81-89.
[2]	余桂东, 周甫, 刘琦. 可迹图的谱充分条件[J]. 运筹学学报, 2017, 21(1): 118-124.
[3]	李浙宁，凌晨，王宜举，杨庆之. 张量分析和多项式优化的若干进展[J]. 运筹学学报, 2014, 18(1): 134-148.
[4]	陈艳, 袁西英, 韩苗苗. 关于三圈图的拉普拉斯谱半径的一些结果[J]. 运筹学学报, 2011, 15(4): 1-8.
[5]	陈琳黄琼湘. 给定顶点数和边数的连通图的Q-谱半径的界[J]. 运筹学学报, 2011, 15(3): 19-28.
[6]	陈琳, 黄琼湘. 给定顶点数和边数的连通图的Q-谱半径[J]. 运筹学学报, 2011, (3): 19-28.
[7]	王力工, 张政. 直径为4的整树新类[J]. 运筹学学报, 2011, 15(2): 19-27.