A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph (Q6160889)
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: A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph |
scientific article; zbMATH DE number 7691480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph |
scientific article; zbMATH DE number 7691480 |
Statements
2 June 2023
0 references
associahedron graph
0 references
triangulation
0 references
smallest eigenvalue
0 references
0.7812411189079285
0 references
0.7692646384239197
0 references
0.7652786374092102
0 references
0.7642691731452942
0 references
0.7628498673439026
0 references
