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 [Formula: see text] , a degree-based entropy measure, the eccentric-entropy [Formula: see text] , the Hosoya entropy [Formula: see text] and, finally, the radial centric information entropy [Formula: see text]. We compare these measures on two infinite classes of fullerene graphs denoted by [Formula: see text] and [Formula: see text]. 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.