An Innovative Combinatorial Approach for the Spanning Tree Entropy in Flower Network

摘要

The spanning tree entropy of a complex network provides a useful insight about its robustness. The most robust network is the network that has the highest entropy. In this paper, we represent construction of a complex network called Flower Network by using two combinatorial approaches: (1) Bipartition and (2) Reduction. We based both methods on geometrical transformation. We also develop topologi-cal properties of the network, obtain analytical expression for its number of spanning trees. In the end, we calculate and compare its spanning tree entropy with those for other networks having the same average degree of nodes for estimating a robust network.