Interrelations of graph distance measures based on topological indices

PLoS One. 2014 Apr 23;9(4):e94985. doi: 10.1371/journal.pone.0094985. eCollection 2014.

Abstract

In this paper, we derive interrelations of graph distance measures by means of inequalities. For this investigation we are using graph distance measures based on topological indices that have not been studied in this context. Specifically, we are using the well-known Wiener index, Randić index, eigenvalue-based quantities and graph entropies. In addition to this analysis, we present results from numerical studies exploring various properties of the measures and aspects of their quality. Our results could find application in chemoinformatics and computational biology where the structural investigation of chemical components and gene networks is currently of great interest.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Computational Biology / methods*
  • Computer Graphics
  • Models, Theoretical

Grants and funding

Matthias Dehmer and Yongtang Shi thank the Austrian Science Funds for supporting this work (project P26142). Yongtang Shi has also been supported by the National Science Foundation of China. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.