Sharp bounds on distance spectral radius of graphs

被引：6

作者：

Lin, Huiqiu ^{[1
]}

Shu, Jinlong ^{[1
]}

机构：

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

来源：

LINEAR & MULTILINEAR ALGEBRA | 2013年 / 61卷 / 04期

基金：

中国国家自然科学基金;

关键词：

distance spectral radius; average distance degree; pseudo distance regular; 05C50; LARGEST EIGENVALUE; MATRIX; NUMBER; TREE;

D O I：

10.1080/03081087.2012.689984

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let D(G) denote the distance matrix of a connected graph G. The largest eigenvalue of D(G) is called the distance spectral radius of a graph G, denoted by ?(G). In this article, we give sharp upper and lower bounds for the distance spectral radius and characterize those graphs for which these bounds are best possible.

引用

页码：442 / 447

页数：6

共 12 条

[1] TOPOLOGICAL INDEXES AND REAL NUMBER VERTEX INVARIANTS BASED ON GRAPH EIGENVALUES OR EIGENVECTORS [J].

BALABAN, AT ;

CIUBOTARIU, D ;

MEDELEANU, M .

JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1991, 31 (04) :517-523

[2]

Bondy J. A., 1976, Graduate Texts in Mathematics, V290

[3]

Gutman I, 1998, INDIAN J CHEM A, V37, P569

[4]

GUTMAN I, 1993, INDIAN J CHEM A, V32, P651

[5] Distance spectral radius of trees with given matching number [J].

Ilic, Aleksandar .

DISCRETE APPLIED MATHEMATICS, 2010, 158 (16) :1799-1806

[6] Sharp bounds on the distance spectral radius and the distance energy of graphs [J].

Indulal, G. .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 430 (01) :106-113

[7]

Indulal G, 2008, MATH COMMUN, V13, P123

[8] THE DISTANCE SPECTRUM OF A TREE [J].

MERRIS, R .

JOURNAL OF GRAPH THEORY, 1990, 14 (03) :365-369

[9]

Minc, 1988, NONNEGATIVE MATRICES

[10] On the theory of matrices [J].

Perron, O .

MATHEMATISCHE ANNALEN, 1907, 64 :248-263

← 1 2 →