Sharp upper bounds on the spectral radius of graphs

被引：32
|
作者：
Shu, JL [1 ]
Wu, YR [1 ]
机构：
[1] E China Normal Univ, Dept Math, Shanghai 200062, Peoples R China
来源：
LINEAR ALGEBRA AND ITS APPLICATIONS | 2004年 / 377卷
基金：
中国国家自然科学基金;
关键词：
spectral radius; upper bound; largest degree; similar matrices;
D O I：
10.1016/j.laa.2003.07.015
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G be a simple connected graph with n vertices, m edges and degree sequence: d(1) greater than or equal to d(2) greater than or equal to (. . .) greater than or equal to d(n). The spectral radius rho(G) of graph G is the largest eigenvalue of its adjacency matrix. In this paper, we present some sharp upper bounds of the spectral radius in terms of the degree sequence of graphs. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码：241 / 248
页数：8
相关论文
共 50 条
12345