Counting the number of spanning trees in a class of double fixed-step loop networks (Q847313)
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: Counting the number of spanning trees in a class of double fixed-step loop networks |
scientific article; zbMATH DE number 5669258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting the number of spanning trees in a class of double fixed-step loop networks |
scientific article; zbMATH DE number 5669258 |
Statements
Counting the number of spanning trees in a class of double fixed-step loop networks (English)
0 references
12 February 2010
0 references
0 references
0 references
0.9571861028671264
0 references
0.9432377219200134
0 references
0.91203111410141
0 references
0.7741718888282776
0 references
