Counting the number of spanning trees in a class of double fixed-step loop networks (Q847313): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.aml.2009.04.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972943602 / rank | |||
Normal rank | |||
Revision as of 01:23, 20 March 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
