A Combinatorial Approach For the Spanning Tree Entropy in Complex Network

The goal of this paper is to propose the combinatorial method to facilitate the calculation of the number of spanning trees for complex networks. In particular, we derive the explicit formulas for the triangular snake, double triangular snake, four triangular snake, the total graph of path, the generalized friendship graphs and the subdivision of double triangular snake. Finally, we calculate their spanning trees entropy and we compare it between them.