On the upper bound for the number of spanning trees of a connected graph (Q2809949)
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: On the upper bound for the number of spanning trees of a connected graph |
scientific article; zbMATH DE number 6587656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the upper bound for the number of spanning trees of a connected graph |
scientific article; zbMATH DE number 6587656 |
Statements
30 May 2016
0 references
spanning tree
0 references
Laplacian eigenvalue
0 references
On the upper bound for the number of spanning trees of a connected graph (English)
0 references
0.8893812298774719
0 references
0.8434473276138306
0 references
0.8386169075965881
0 references
0.832326352596283
0 references
