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 bounds on the spectral radius of weighted graphs, Appl. Math. Comput. 218 (2012) 5231–5238]. In addition, some related results are also provided. [ABSTRACT FROM AUTHOR]