Skip to main navigation Skip to search Skip to main content

On properties of distance-based entropies on fullerene graphs

  • Modjtaba Ghorbani*
  • , Matthias Dehmer
  • , Mina Rajabi-Parsa
  • , Abbe Mowshowitz
  • , Frank Emmert-Streib
  • *Corresponding author for this work
  • Shahid Rajaee Teacher Training University
  • Upper Austria University of Applied Sciences
  • Private University for Health Sciences, Medical Informatics and Technology
  • Nankai University
  • City University of New York
  • Tampere University
  • Institute of Biosciences and Medical Technology

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we study several distance-based entropy measures on fullerene graphs. These include the topological information content of a graph Iα(G), a degree-based entropy measure, the eccentric-entropy I fσ(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.

Original languageEnglish
Article number482
JournalEntropy
Volume21
Issue number5
DOIs
Publication statusPublished - May 2019
Externally publishedYes

Keywords

  • Eccentricity
  • Graph entropy
  • Hosoya polynomial

Fingerprint

Dive into the research topics of 'On properties of distance-based entropies on fullerene graphs'. Together they form a unique fingerprint.

Cite this