A new upper bound on the number of spanning trees of a graph (Q2860832)
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 new upper bound on the number of spanning trees of a graph |
scientific article; zbMATH DE number 6225406
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound on the number of spanning trees of a graph |
scientific article; zbMATH DE number 6225406 |
Statements
11 November 2013
0 references
spanning tree
0 references
normalized Laplacian eigenvalue
0 references
A new upper bound on the number of spanning trees of a graph (English)
0 references
