A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (Q1415294)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2012705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. |
scientific article; zbMATH DE number 2012705 |
Statements
A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (English)
0 references
3 December 2003
0 references
Graph
0 references
Laplacian matrix
0 references
Largest eigenvalue
0 references
Upper bound
0 references
0.932010531425476
0 references
0.932010531425476
0 references
0.8864789605140686
0 references
0.8435438275337219
0 references
0.8406115770339966
0 references
