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

Publikation: Beitrag in FachzeitschriftArtikel

3 Zitate (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.

OriginalspracheEnglisch
Seiten (von - bis)739-749
Seitenumfang11
FachzeitschriftApplied Mathematics Modelling
Jahrgang59
DOIs
PublikationsstatusVeröffentlicht - Jul 2018

Fingerprint

Untersuchen Sie die Forschungsthemen von „Properties of Graph Distance Measures by Means of Discrete Inequalities“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren