Further analysis of the number of spanning trees in circulant graphs (Q860448): 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.disc.2006.05.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121225779 / rank | |||
Normal rank | |||
Revision as of 01:13, 20 March 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
