Generalized Entropies of Subdivision-Corona Networks

The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph. Entropy functions have been used successfully to capture different aspects of graph complexity. The generalized graph entropies result from applying information measures to a graph using various schemes for defining probability distributions over the elements of the graph. In this paper, we investigate the complexity of a class of composite graphs based on subdivision graphs and corona product evaluating the generalized graph entropies, and we present explicit formulae for the complexity of subdivision-corona type product graphs.