Further analysis of the number of spanning trees in circulant graphs (Q860448): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:14, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Further analysis of the number of spanning trees in circulant graphs |
scientific article |
Statements
Further analysis of the number of spanning trees in circulant graphs (English)
0 references
9 January 2007
0 references
Let \(T(C_n^{s_1,s_2,\dots,s_k})=na_n^2\) denote the number of spanning trees of the graph \(C_n^{s_1,s_2,\dots,s_k}\). The authors investigate the numbers \(a_n\) further and, in particular, give asymptotic results on these quantities.
0 references
spanning tree numbers
0 references
circulant graphs
0 references
