A sharp upper bound of the spectral radius of graphs

被引：139

作者：

Hong, Y ^{[1
]}

Shu, JL

Fang, KF

机构：

[1] E China Normal Univ, Dept Math, Shanghai 200062, Peoples R China

[2] Huzhou Teacher Coll, Dept Math, Huzhou 313000, Zhejiang, Peoples R China

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2001年 / 81卷 / 02期

关键词：

spectral radius; upper bounds; minor; genus;

D O I：

10.1006/jctb.2000.1997

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a simple connected graph with n vertices and m edges. Let S(G) = S br the minimum degree of vertices of G. Thr spectral radius p(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, we obtain the following sharp upper bound of p(G): [GRAPHICS] Equality holds if and only if G is either a regular graph or a bidegreed graph in which each vertex is of degree either S or n - 1. (C) 2001 Academic Press.

引用

页码：177 / 183

页数：7

共 12 条

[1]

[Anonymous], [No title captured]

[2]

Bondy J. A., 1976, Graph theory with applications

[3]

BURALDI RA, LINEAR ALGEBRA APPL, V65, P133

[4]

Cvetkovic D. M., 1980, Spectra of Graphs-Theory and Application

[5] The spectral radius of graphs on surfaces [J].

Ellingham, MN ;

Zha, XY .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2000, 78 (01) :45-56

[6]

HONG Y, 1988, LINEAR ALGEBRA APPL, V108, P135

[7]

HONG Y, 1998, J COMB THEORY B, V74, P153

[8]

HONG Y, SPECTRAL RADIUS GRAP

[9]

SHU JL, IN PRESS CHINESE A A

[10] A BOUND ON THE SPECTRAL-RADIUS OF GRAPHS WITH E-EDGES [J].

STANLEY, RP .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1987, 87 :267-269

← 1 2 →