In the present paper, we investigate the complexity of infinite family of graphs H n = H n (G 1 , G 2 , . . . , G m ) obtained as a circulant foliation over a graph H on m vertices with fibers G 1 , G 2 , . . . , G m . Each fiber G i = C n (s i,1 , s i,2 , . . . , s i,ki ) of this foliation is the circulant graph on n vertices with jumps s i,1 , s i,2 , . . . , s i,ki . This family includes the family of generalized Petersen graphs, I-graphs, sandwiches of circulant graphs, discrete torus graphs and others.We obtain a closed formula for the number τ (n) of spanning trees in H n in terms of Chebyshev polynomials, investigate some arithmetical properties of this function and find its asymptotics as n → ∞.