Complexity of the Sequence of some Families of Graphs Based on Tridiminished icosahedron Graph

Tridiminished icosahedron graph is one of nonahedral graphs. In this work, using knowledge of difference equations we drive the explicit formulas for the number of spanning trees in the sequence of some new families of graphs of average degree four based on Tridiminished icosahedron graph by electrically equivalent transformations and rules of weighted generating function. Finally, we compare the entropy of our graphs with other studied graphs with average degree being 4.