On the bounds for the largest Laplacian eigenvalues of weighted graphs

On the bounds for the largest Laplacian eigenvalues of weighted graphs

0.00 Avg rating—0 Votes
Article ID: iaor20124029
Volume: 9
Issue: 2
Start Page Number: 122
End Page Number: 129
Publication Date: May 2012
Journal: Discrete Optimization
Authors: ,
Keywords: matrices
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 G. We obtain an upper bound for the largest Laplacian eigenvalue and we compare this bound with previously known bounds.

Reviews

Required fields are marked *. Your email address will not be published.