Article ID Journal Published Year Pages File Type
1141815 Discrete Optimization 2012 8 Pages PDF
Abstract

We consider weighted graphs, such as graphs where the edge weights are positive definite matrices. The Laplacian eigenvalues of a graph are the eigenvalues of the Laplacian matrix of a graph GG. We obtain an upper bound for the largest Laplacian eigenvalue and we compare this bound with previously known bounds.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Control and Optimization
Preview
On the bounds for the largest Laplacian eigenvalues of weighted graphs
Authors
, ,