Upper bound for the Laplacian graph eigenvalues (Q1780291)
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: Upper bound for the Laplacian graph eigenvalues |
scientific article; zbMATH DE number 2174193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bound for the Laplacian graph eigenvalues |
scientific article; zbMATH DE number 2174193 |
Statements
Upper bound for the Laplacian graph eigenvalues (English)
0 references
7 June 2005
0 references
The authors present two new upper bounds for the largest Laplacian eigenvalue of a connected graph, in terms of the largest and smallest degrees, and the numbers of vertices and edges of the graph. They also determine the extremal graphs which achieve the upper bounds.
0 references
Laplacian matrix
0 references
Largest eigenvalue
0 references
upper bound
0 references
connected graph
0 references
extremal graphs
0 references
0.9043239951133728
0 references
0.9007071852684021
0 references
0.8990497589111328
0 references
0.8985529541969299
0 references
