A note on upper bounds for the spectral radius of weighted graphs
作者:
Highlights:
•
摘要
Let 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.
论文关键词:Weighted graph,Adjacency matrix,Spectral radius,Upper bound
论文评审过程:Available online 26 June 2014.
论文官网地址:https://doi.org/10.1016/j.amc.2014.05.106