Back to Search Start Over

A sharp upper bound on the spectral radius of weighted graphs

Authors :
Das, Kinkar Ch.
Bapat, R.B.
Source :
Discrete Mathematics. Aug2008, Vol. 308 Issue 15, p3180-3186. 7p.
Publication Year :
2008

Abstract

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. [Copyright &y& Elsevier]

Subjects

Subjects :
*MATRICES (Mathematics)
*EIGENVALUES
*UNIVERSAL algebra
*COMPUTATIONAL mathematics

Details

Language :
English
ISSN :
0012365X
Volume :
308
Issue :
15
Database :
Academic Search Index
Journal :
Discrete Mathematics
Publication Type :
Academic Journal
Accession number :
32076017
Full Text :
https://doi.org/10.1016/j.disc.2007.06.020
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details