A Bound On The Spectral Radius of A Weighted Graph

Let   G be simple, connected weighted graphs, where the edge weights are positive definite matrices. In this paper, we will ive an upper bound on the spectral radius of the adjacency matrix for a graph G and characterize graphs for which the bound is attained.