Das, Kinkar Ch. ; Bapat, R. B. (2005) A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs Linear Algebra and its Applications, 409 . pp. 153-165. ISSN 0024-3795
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.laa.2005.06.024
Abstract
We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of the graph is defined in the usual way. We obtain an upper bound on the largest eigenvalue of the Laplacian and characterize graphs for which the bound is attained. The classical bound of Anderson and Morley, for the largest eigenvalue of the Laplacian of an unweighted graph follows as a special case.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Weighted Graph; Laplacian Matrix; Largest Eigenvalue; Upper Bound |
| ID Code: | 78311 |
| Deposited On: | 19 Jan 2012 06:33 |
| Last Modified: | 19 Jan 2012 06:33 |
Repository Staff Only: item control page
