Title of article
The number of spanning trees in odd valent circulant graphs Original Research Article
Author/Authors
Xiebin Chen، نويسنده , , Qiuying Lin، نويسنده , , Fuji Zhang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
11
From page
69
To page
79
Abstract
In this paper, we consider the number of spanning trees in circulant graphs. For any class of odd valent circulant graphs C2n(a1,a2,…,ak−1,n), where a1,a2,…,ak−1 are fixed jumps and n varies, some formulas, asymptotic behaviors and linear recurrence relations for the number of its spanning trees are obtained, and some known results on the ones in even valent circulant graphs Cn(a1,a2,…,ak) are improved.
Keywords
Spanning tree , Circulant graph , Asymptotic behavior , Linear recurrence relation
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948888
Link To Document