| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4631964 | Applied Mathematics and Computation | 2011 | 7 Pages |
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 a lower bound and an upper bound on the spectral radius of the adjacency matrix of weighted graphs and characterize graphs for which the bounds are attained.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Kinkar Ch. Das,