Further analysis of the number of spanning trees in circulant graphs (Q860448)
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: Further analysis of the number of spanning trees in circulant graphs |
scientific article; zbMATH DE number 5083189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Further analysis of the number of spanning trees in circulant graphs |
scientific article; zbMATH DE number 5083189 |
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
0 references
