Sign in
Back
Number of Spanning Trees of Some Circulant Graphs and Their Asymptotic Behavior
Journal article

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

A. Elsonbaty, S. N. Daoud and H. Al-Ahmady
International journal of applied mathematics & statistics, Vol.30(6), pp.93-102
01/01/2012

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
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.

Metrics

1 Record Views

Details