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

doi:10.1016/j.apm.2018.01.027

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

^*Tämän työn vastaava kirjoittaja

Tutkimustuotos: Artikkeli › Tieteellinen › vertaisarvioitu

7 Sitaatiot (Scopus)

Abstrakti

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.

Alkuperäiskieli	Englanti
Sivut	739-749
Sivumäärä	11
Julkaisu	Applied Mathematical Modelling
Vuosikerta	59
DOI - pysyväislinkit	https://doi.org/10.1016/j.apm.2018.01.027
Tila	Julkaistu - 1 heinäk. 2018
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Rahoitus

Matthias Dehmer thanks the Austrian Science Funds for supporting this work (project P26142). Zengqiang Chen was supported by the National Science Foundation of China (No. 61573199 ) and the Natural Science Foundation of Tianjin (No. 14JCYBJC18700 ). Yongtang Shi was partially supported by the Natural Science Foundation of Tianjin (No. 17JCQNJC00300 ) and National Natural Science Foundation of China.

Julkaisufoorumi-taso

Jufo-taso 1

!!ASJC Scopus subject areas

Modelling and Simulation
Applied Mathematics

Pääsy asiakirjaan

10.1016/j.apm.2018.01.027

Siteeraa tätä

@article{885a7d592728418fb41774d00a8bfd0b,

title = "Properties of graph distance measures by means of discrete inequalities",

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.",

keywords = "Distance measures, Graphs, Inequalities, Networks, Similarity measures",

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

note = "EXT={"}Tripathi, Shailesh{"}",

year = "2018",

month = jul,

day = "1",

doi = "10.1016/j.apm.2018.01.027",

language = "English",

volume = "59",

pages = "739--749",

journal = "Applied Mathematical Modelling",

issn = "0307-904X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Properties of graph distance measures by means of discrete inequalities

AU - Dehmer, Matthias

AU - Chen, Zengqiang

AU - Emmert-Streib, Frank

AU - Shi, Yongtang

AU - Tripathi, Shailesh

AU - Musa, Aliyu

AU - Mowshowitz, Abbe

N1 - EXT="Tripathi, Shailesh"

PY - 2018/7/1

Y1 - 2018/7/1

N2 - 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.

AB - 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.

KW - Distance measures

KW - Graphs

KW - Inequalities

KW - Networks

KW - Similarity measures

U2 - 10.1016/j.apm.2018.01.027

DO - 10.1016/j.apm.2018.01.027

M3 - Article

AN - SCOPUS:85044481326

SN - 0307-904X

VL - 59

SP - 739

EP - 749

JO - Applied Mathematical Modelling

JF - Applied Mathematical Modelling

ER -

Properties of graph distance measures by means of discrete inequalities

Abstrakti

Rahoitus

Julkaisufoorumi-taso

!!ASJC Scopus subject areas

Pääsy asiakirjaan

Sormenjälki

Siteeraa tätä