The number of spanning trees in a class of double fixed-step loop networks (Q3528151): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4770409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanning tree formulas and Chebyshev polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fault-tolerant routings in double fixed-step networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms and Computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5332459 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of spanning trees in directed circulant graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting spanning trees in the graphs of Kleitman and Golden and a generalization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of spanning trees in circulant graphs / rank | |||
Normal rank | |||
Revision as of 17:03, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of spanning trees in a class of double fixed-step loop networks |
scientific article |
Statements
The number of spanning trees in a class of double fixed-step loop networks (English)
0 references
8 October 2008
0 references
circulant digraph
0 references
spanning tree
0 references
matrix tree theorem
0 references
double loop network
0 references
step loop network
0 references
step double loop network
0 references
