Bounds for the largest Laplacian eigenvalue of weighted graphs (Q1953663)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounds for the largest Laplacian eigenvalue of weighted graphs |
scientific article; zbMATH DE number 6172108
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds for the largest Laplacian eigenvalue of weighted graphs |
scientific article; zbMATH DE number 6172108 |
Statements
Bounds for the largest Laplacian eigenvalue of weighted graphs (English)
0 references
10 June 2013
0 references
Summary: Let \(G\) be weighted graphs, as the graphs where the edge weights are positive definite matrices. The Laplacian eigenvalues of a graph are the eigenvalues of Laplacian matrix of a graph \(G\). We obtain two upper bounds for the largest Laplacian eigenvalue of weighted graphs and we compare these bounds with previously known bounds.
0 references
weighted graphs
0 references
Laplacian eigenvalues
0 references
Laplacian matrices
0 references
upper bound
0 references
0 references
0.9842260479927064
0 references
0.9547027945518494
0 references
0.9349728226661682
0 references
0.927867352962494
0 references
