Quantifying structural complexity of graphs: Information measures in mathematical chemistry

Matthias Dehmer, Frank Emmert-Streib, Yury Robertovich Tsoy, Kurt Varmuza

    Tutkimustuotos: LukuTieteellinenvertaisarvioitu

    9 Sitaatiot (Scopus)

    Abstrakti

    In this chapter, we give a conceptional view about information measures for graphs which can be used to quantify their structural complexity. We focus on treating such measures in the context of mathematical chemistry but we want to mention that those are also applicable for arbitrary complex networks. Besides reviewing the most known information indices often used in chemical graph theory, we propose an information functional that is based on degree-degree associations in a graph. This leads us to a parametric graph entropy measure to quantify the structural information content of a graph. A brief numerical example shows how the measure can be calculated explicitly.

    AlkuperäiskieliEnglanti
    OtsikkoQuantum Frontiers of Atoms and Molecules
    ToimittajatMihai V. Putz
    KustantajaNova Science Publishers, Inc.
    Sivut479-497
    Sivumäärä19
    ISBN (painettu)9781616681586
    TilaJulkaistu - 2011
    OKM-julkaisutyyppiA3 Kirjan tai muun kokoomateoksen osa

    !!ASJC Scopus subject areas

    • Yleinen kemia

    Sormenjälki

    Sukella tutkimusaiheisiin 'Quantifying structural complexity of graphs: Information measures in mathematical chemistry'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

    Siteeraa tätä