On Properties of Distance-Based Entropies on Fullerene Graphs

Authors

Modjtaba Ghorbani, Shahid Rajaee Teacher Training University
Matthias Dehmer, University of Applied Sciences Upper Austria
Mina Rajabi-Parsa, Shahid Rajaee Teacher Training University
Abbe Mowshowitz, CUNY City CollegeFollow
Frank Emmert-Streib, Tampere University of Technology

Document Type

Article

Publication Date

5-10-2019

Abstract

In this paper, we study several distance-based entropy measures on fullerene graphs. These include the topological information content of a graph I_a(G), a degree-based entropy measure, the eccentric-entropy If_s(G), the Hosoya entropy H(G) and, finally, the radial centric information entropy H_ecc. We compare these measures on two infinite classes of fullerene graphs denoted by A_12n+4 and B_12n+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.

Comments

This work was originally published in entropy, available at https://doi.org/10.3390/e21050482.

This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).