Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4631350 | Applied Mathematics and Computation | 2012 | 8 Pages |
Abstract
Let us consider weighted graphs, where the weights of the edges are positive definite matrices. The eigenvalues of a weighted graph are the eigenvalues of its adjacency matrix and the spectral radius of a weighted graph is also the spectral radius of its adjacency matrix. In this paper, we obtain two upper bounds for the spectral radius of weighted graphs and compare with a known upper bound. We also characterize graphs for which the upper bounds are attained.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Sezer Sorgun, Åerife Büyükköse,