Article ID Journal Published Year Pages File Type
4650540 Discrete Mathematics 2008 7 Pages PDF
Abstract

We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain an upper bound on the spectral radius of the adjacency matrix and characterize graphs for which the bound is attained.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A sharp upper bound on the spectral radius of weighted graphs
Authors
, ,