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

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

有向图谱半径的上界

方坤夫1, 束金龙2   

  1. 1.湖州师范学院　数学系，　浙江湖州 313000; 2.华东师范大学　数学系，　上海 200062
  • 收稿日期:2003-03-14 修回日期:2003-06-17 出版日期:2004-12-25 发布日期:2004-12-25
  • 通讯作者: 方坤夫

Upper Bounds on the Spectral Radius of Digraphs

FANG Kun-fu1, SHU Jin-long2   

  1. 1.Department of Mathematics, Huzhou Teachers College, Huzhou Zhejiang 313000, China; 2.Department of Mathematics, East China Normal University, Shanghai 200062, China
  • Received:2003-03-14 Revised:2003-06-17 Online:2004-12-25 Published:2004-12-25
  • Contact: FANG Kun-fu

摘要： 本文利用矩阵理论, 给出了用图的出度序列表示的简单有向图的谱半径的可达上界, 同时还刻画了达到上界的极图.

关键词: 有向图, 邻接矩阵, 谱半径, 出度序列, 有向图, 邻接矩阵, 谱半径, 出度序列

Abstract: In this paper, using the matrix theory, we present a sharp upper bound on the spectral radius of digraphs in terms of the out-degree sequence. Meanwhile, we characterize the extremal digraphs which spectral radius reaches the upper bound.

Key words: Adjacency matrix, Spectral radius, Out-degree sequence, Digraph, Adjacency matrix, Spectral radius, Out-degree sequence

中图分类号: