On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs (Q2978176)
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 6707225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs |
scientific article; zbMATH DE number 6707225 |
Statements
On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs (English)
0 references
21 April 2017
0 references
spanning tree
0 references
cubic graph
0 references
edge connectivity
0 references
0.93711084
0 references
0.9322566
0 references
0 references
0.9263387
0 references
0.92470556
0 references
0.9241689
0 references
0.9215868
0 references
0.91905355
0 references
0.9175592
0 references
