Graph distance measures based on topological indices revisited

Matthias Dehmer, Frank Emmert-Streib and Yongtang Shi

Applied Mathematics and Computation, 2015, vol. 266, issue C, 623-633

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.

Keywords: Distance measure; Edit distance; Topological index; Extremal graph (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315006967
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:266:y:2015:i:c:p:623-633

DOI: 10.1016/j.amc.2015.05.072

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().