Upper bound for the Laplacian graph eigenvalues (Q1780291): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10114-004-0332-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10114-004-0332-4 / rank | |||
Normal rank | |||
Latest revision as of 10:52, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bound for the Laplacian graph eigenvalues |
scientific article |
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
