A note on upper bounds for the spectral radius of weighted graphs

Let G=(V,E) be a simple connected weighted graph on n vertices, in which the edge weights are positive definite matrices. The eigenvalues of G are the eigenvalues of its adjacency matrix. In this note, we present a correction in equality part in Theorem 2 [S. Sorgun, S. Büyükköse, The new upper boun...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 243; pp. 392 - 397
Main Authors Tian, Gui-Xian, Huang, Ting-Zhu
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.09.2014
Subjects
Adjacency matrix
Computation
Eigenvalues
Graphs
Mathematical analysis
Mathematical models
Matrices (mathematics)
Spectra
Spectral radius
Upper bound
Upper bounds
Weighted graph
Adjacency matrix
Upper bound
Spectral radius
Weighted graph
Online AccessGet full text
ISSN0096-3003
1873-5649
DOI10.1016/j.amc.2014.05.106

Cover

More Information
Summary:Let G=(V,E) be a simple connected weighted graph on n vertices, in which the edge weights are positive definite matrices. The eigenvalues of G are the eigenvalues of its adjacency matrix. In this note, we present a correction in equality part in Theorem 2 [S. Sorgun, S. Büyükköse, The new upper bounds on the spectral radius of weighted graphs, Appl. Math. Comput. 218 (2012) 5231–5238]. In addition, some related results are also provided.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2014.05.106