Graph Operations based on Using Distance-based Graph Entropies

Modjtaba Ghorbani, Matthias Dehmer, Samaneh Zangi

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


Let G be a connected graph. The eccentricity of vertex v is the maximum distance between v and other vertices of G. In this paper, we study a new version of graph entropy based on eccentricity of vertices of G. In continuing, we study this graph entropy for some classes of graph operations. Finally, we compute the graph entropy of two classes of fullerene graphs.

Original languageEnglish
Pages (from-to)547-555
Number of pages9
JournalApplied Mathematics and Computation
Publication statusPublished - 15 Sept 2018


  • Automorphism group
  • Fullerene
  • Graph entropy


Dive into the research topics of 'Graph Operations based on Using Distance-based Graph Entropies'. Together they form a unique fingerprint.

Cite this