Properties of graph distance measures by means of discrete inequalities

Matthias Dehmer, Zengqiang Chen, Frank Emmert-Streib, Yongtang Shi, Shailesh Tripathi, Aliyu Musa, Abbe Mowshowitz

    Research output: Contribution to journalArticleScientificpeer-review

    4 Citations (Scopus)

    Abstract

    In this paper, we investigate graph distance measures based on topological graph measures. Those measures can be used to measure the structural distance between graphs. When studying the scientific literature, one is aware that measuring distance/similarity between graphs meaningfully has been intricate. We demonstrate that our measures are well-defined and prove bounds for investigating their value domain. Also, we generate numerical results and demonstrate that the measures have useful properties.

    Original languageEnglish
    Pages (from-to)739-749
    Number of pages11
    JournalApplied Mathematical Modelling
    Volume59
    DOIs
    Publication statusPublished - 1 Jul 2018
    Publication typeA1 Journal article-refereed

    Keywords

    • Distance measures
    • Graphs
    • Inequalities
    • Networks
    • Similarity measures

    Publication forum classification

    • Publication forum level 1

    ASJC Scopus subject areas

    • Modelling and Simulation
    • Applied Mathematics

    Fingerprint

    Dive into the research topics of 'Properties of graph distance measures by means of discrete inequalities'. Together they form a unique fingerprint.

    Cite this