Undirected simple connected graphs with minimum number of spanning trees (Q1025924)
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 5569052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Undirected simple connected graphs with minimum number of spanning trees |
scientific article; zbMATH DE number 5569052 |
Statements
Undirected simple connected graphs with minimum number of spanning trees (English)
0 references
23 June 2009
0 references
undirected simple graph
0 references
spanning tree
0 references
enumeration
0 references
0.868989109992981
0 references
0.8049085140228271
0 references
0.7884303331375122
0 references
0.7873093485832214
0 references
