an:02083684
Zbl 1042.05051
Chen, Xiebin; Lin, Qiuying; Zhang, Fuji
The number of spanning trees in odd valent circulant graphs
EN
Discrete Math. 282, No. 1-3, 69-79 (2004).
00107524
2004
j
05C30 05C05
Spanning tree; Circulant graph; Linear recurrence relation; Asymptotic behavior
Summary: We consider the number of spanning trees in circulant graphs. For any class of odd valent circulant graphs \(C_{2n}(a_1,a_2,\dots ,a_{k-1},n)\), where \(a_1,a_2,\dots ,a_{k-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 \(C_n(a_1,a_2,\dots ,a_k)\) are improved.