On the Spectral Radius of Bistarlike Tree

摘要：

A tree is said to be starlike if exactly one of its vertices has degree larger than 2. A bistarlike tree is obtained from two starlike trees S1 and S2, adding a path between the maximum degree vertex of S1 and S2, respectively. Gutman 4 and L. Shi 7 give a bound of the spectral radius of starlike tree. In this paper, we show that a new upper bound of the spectral radius of bistarlike tree.

关键词： Bistarlike tree Spectra of graphs Spectral radius

作者: Tingzeng Wu Shengbiao Hu

作者单位: Department of Mathematics, Qinghai Nationalities University, Xining, 810007, P.R.China

会议类型: 国际会议

会议名称: The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)

会议地点: 杭州

会议语种:英文

页码: 1125-1129

在线出版日期: 2009-07-09（万方平台首次上网日期，不代表论文的发表时间）