A bound on the spectral radius of a weighted graph

Abstract

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