华东师范大学学报(自然科学版) ›› 2004, Vol. 2004 ›› Issue (3): 22-28.

• 数学 统计学 • 上一篇    下一篇

关于树的谱半径

吴宝丰1，2， 袁西英1，2， 肖恩利1   

  1. 1. 华东师范大学 数学系，上海 200062; 2. 上海理工大学 理学院，上海 200093
  • 收稿日期:2002-06-14 修回日期:2003-09-16 出版日期:2004-09-25 发布日期:2004-09-25
  • 通讯作者: 吴宝丰

On the Spectral Radii of Trees

WU Bao-feng1,2, YUAN Xi-ying1,2, XIAO En-li1   

  1. 1. Department of Mathematics, East China Normal University, Shanghai 200062， China; 2. College of Science, University of Shanghai for Science and Technology, Shanghai 200093, China
  • Received:2002-06-14 Revised:2003-09-16 Online:2004-09-25 Published:2004-09-25
  • Contact: WU Bao-feng

摘要： 刻画了谱半径次小、第三小、…、第七小的n阶树，同时刻画了最大度为3且三度点个数分别为1、2、3时谱半径最小和最大的树.

关键词: 树, 谱半径, 排序, 树, 谱半径, 排序

Abstract: We focus on the ordering of trees on n vertices and determine seven trees with small spectral radii. We also consider the following problem: of all trees with maximal degree 3 on n vertices which achieves the minimal and maximal spectral radius when the vertices number of degree 3 is one, two and three, respectively?

Key words: spectral radius, ordering, tree, spectral radius, ordering

中图分类号: