Entropy of weighted graphs with Randić weights

Zengqiang Chen, Matthias Dehmer, Frank Emmert-Streib, Yongtang Shi

    Research output: Contribution to journalArticleScientificpeer-review

    27 Citations (Scopus)

    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 - 2015
    Publication typeA1 Journal article-refereed

    Keywords

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

    Publication forum classification

    • Publication forum level 0

    ASJC Scopus subject areas

    • General Physics and Astronomy

    Fingerprint

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

    Cite this