Complexity trees of the sequence of some nonahedral graphs generated by triangle

Abstract

Calculating the number of spanning trees of a graph is one of the widely studied graph problems since the Pioneer Gustav Kirchhoff (1847). In this work, using knowledge of difference equations we drive the explicit formulas for the number of spanning trees in the sequence of some Nonahedral (nine faced polyhedral) graphs generated by triangle using electrically equivalent transformations and rules of the weighted generating function. Finally, we evaluate the entropy of graphs in this manuscript with different studied graphs with an average degree being 4, 5 and 6.

Keywords

• Mathematics
• Number of spanning trees
• Entropy
• Electrically equivalent transformations