Graph distance measures based on topological indices revisited

Matthias Dehmer, Frank Emmert-Streib, Yongtang Shi

    Research output: Contribution to journalArticleScientificpeer-review

    21 Citations (Scopus)

    Abstract

    Graph distance measures based on topological indices have been already explored by Dehmer et al. Also, inequalities for those graph distance measures have been proved. In this paper, we continue studying such comparative graph measures based on the well-known Wiener index, graph energy and Randić index, respectively. We prove extremal properties of the graph distance measures for some special classes of graphs. To demonstrate useful properties of the measures, we also discuss numerical results. To conclude the paper we state some open problems.

    Original languageEnglish
    Pages (from-to)623-633
    Number of pages11
    JournalApplied Mathematics and Computation
    Volume266
    DOIs
    Publication statusPublished - 18 Jun 2015
    Publication typeA1 Journal article-refereed

    Keywords

    • Distance measure
    • Edit distance
    • Extremal graph
    • Topological index

    Publication forum classification

    • Publication forum level 1

    ASJC Scopus subject areas

    • Applied Mathematics
    • Computational Mathematics

    Fingerprint

    Dive into the research topics of 'Graph distance measures based on topological indices revisited'. Together they form a unique fingerprint.

    Cite this