Number of Spanning Trees of Some Circulant Graphs and Their Asymptotic Behavior

Abstract

The complexity of a graph is the number of its spanning trees . We compute this quantity for some families of circulant graphs with three jumps where the jumps divide the number of vertices. Some other cases are studied. We also study some asymptotic limits related to this important quantity.