On properties of distance-based entropies on fullerene graphs

Modjtaba Ghorbani, Matthias Dehmer, Mina Rajabi-Parsa, Abbe Mowshowitz, Frank Emmert-Streib

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

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 I f σ ( G ) , the Hosoya entropy H ( G ) and, finally, the radial centric information entropy H e c c . We compare these measures on two infinite classes of fullerene graphs denoted by A 12 n + 4 and B 12 n + 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

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