No abstract

No 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; : : : ; a k−1 ; n), where a1; a2; : : : ; a k−1 are ÿxed 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; : : : ; a k ) are improved.

No abstract

No abstract