Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues (Q942089)
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: Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues |
scientific article; zbMATH DE number 5321334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues |
scientific article; zbMATH DE number 5321334 |
Statements
Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues (English)
0 references
4 September 2008
0 references
tree
0 references
Laplacian eigenvalues
0 references
spectral radius
0 references
matching number
0 references
0 references
0.93970543
0 references
0.9362322
0 references
0.9305776
0 references
0 references
0 references
0.91729355
0 references
0 references
