Counting the number of spanning trees in a class of double fixed-step loop networks (Q847313): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:36, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting the number of spanning trees in a class of double fixed-step loop networks |
scientific article |
Statements
Counting the number of spanning trees in a class of double fixed-step loop networks (English)
0 references
12 February 2010
0 references