A sharp upper bound on the largest Lapla
β
Kinkar Ch. Das; R.B. Bapat
π
Article
π
2005
π
Elsevier Science
π
English
β 217 KB
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