An Upper Bound On The Spectral Radius of Weighted Graphs
Sezer Sorgun, Şerife Büyükköse, Hikmet Özarslan · DergiPark (Istanbul University) · 2013
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of itsadjacency matrix. We obtain another upper bound which is sharp onthe spectral radius of the adjacency matrix and compare with someknown upper bounds with the help of some examples of graphs. Wealso characterize graphs for which the bound is attained.