On Properties of Distance-Based Entropies on Fullerene Graphs

In this paper, we study several distance-based entropy measures on fullerene graphs. These include the topological information content of a graph Ia(G), a degree-based entropy measure, the eccentric-entropy Ifs(G), the Hosoya entropy H(G) and, finally, the radial centric information entropy Hecc. We compare these measures on two infinite classes of fullerene graphs denoted by A12n+4 and B12n+6. We have chosen these measures as they are easily computable and capture meaningful graph properties. To demonstrate the utility of these measures, we investigate the Pearson correlation between them on the fullerene graphs