Complexity of Sequence of Some Families of Graphs and Their Asymptotic Behavior.

Calculating and analyzing the number of spanning trees of networks (graphs) is an interesting and important research project in wide variety of fields, such as mathematics, theoretical computer science, chemistry, physics and so on. In this paper, we investigated the number of spanning trees in three sequences of families of graphs of the same average degree 14. We used the electrically equivalent transformations and rules of weighted generating function which avoids the laborious computation of the determinant for counting the number of spanning trees. Finally, we determined the entropy of our studied graphs. [ABSTRACT FROM AUTHOR]