Title of article
A sharp upper bound on the spectral radius of weighted graphs Original Research Article
Author/Authors
Kinkar Ch. Das، نويسنده , , R.B. Bapat، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
7
From page
3180
To page
3186
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
Weighted graph , Adjacency matrix , spectral radius , Upper bound
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
946929
Link To Document