Skip to main navigation Skip to search Skip to main content

Entropy of weighted graphs with Randić weights

  • Zengqiang Chen
  • , Matthias Dehmer*
  • , Frank Emmert-Streib
  • , Yongtang Shi
  • *Corresponding author for this work
  • Nankai University
  • Universität der Bundeswehr München
  • Private University for Health Sciences, Medical Informatics and Technology
  • Tampere University

Research output: Contribution to journalArticlepeer-review

Abstract

Shannon entropies for networks have been widely introduced. However, entropies for weighted graphs have been little investigated. Inspired by the work due to Eagle et al., we introduce the concept of graph entropy for special weighted graphs. Furthermore, we prove extremal properties by using elementary methods of classes of weighted graphs, and in particular, the one due to Bollobás and Erdös, which is also called the Randić weight. As a result, we derived statements on dendrimers that have been proven useful for applications. Finally, some open problems are presented.

Original languageEnglish
Pages (from-to)3710-3723
Number of pages14
JournalEntropy
Volume17
Issue number6
DOIs
Publication statusPublished - 5 Jun 2015
Externally publishedYes

Keywords

  • Extremal value
  • Graph entropy
  • Randić weight
  • Shannon's entropy
  • Weighted graphs

Fingerprint

Dive into the research topics of 'Entropy of weighted graphs with Randić weights'. Together they form a unique fingerprint.

Cite this