A sharp upper bound on the spectral radius of weighted graphs

Das, Kinkar Ch. ; Bapat, R. B. (2008) A sharp upper bound on the spectral radius of weighted graphs Discrete Mathematics, 308 (15). pp. 3180-3186. ISSN 0012-365X

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/S...

Related URL: http://dx.doi.org/10.1016/j.disc.2007.06.020

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.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
Keywords:Weighted Graph; Adjacency Matrix; Spectral Radius; Upper Bound
ID Code:78322
Deposited On:19 Jan 2012 06:33
Last Modified:19 Jan 2012 06:33

Repository Staff Only: item control page