Properties of graph distance measures by means of discrete inequalities
Research output: Contribution to journal › Article › Scientific › peer-review
|Number of pages||11|
|Journal||Applied Mathematical Modelling|
|Publication status||Published - 1 Jul 2018|
|Publication type||A1 Journal article-refereed|
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.