The uniqueness of DMAX-matrix graph invariants

Matthias Dehmer; Yongtang Shi

doi:10.1371/journal.pone.0083868

The uniqueness of DMAX-matrix graph invariants

PLoS One. 2014 Jan 2;9(1):e83868. doi: 10.1371/journal.pone.0083868. eCollection 2014.

Authors

Matthias Dehmer¹, Yongtang Shi²

Affiliations

¹ Institute for Bioinformatics and Translational Research, UMIT, Eduard Wallnoefer Zentrum 1, A-6060, Hall in Tyrol, Austria.
² Center for Combinatorics and LPMC-TJKLC, Nankai University, Tianjin, P.R. China.

Abstract

In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix DMAX defined by Randić et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees only. Using these graph classes allow us to generalize the findings towards complex networks as they usually do not possess any structural constraints. We obtain that the uniqueness of this newly proposed graph invariant is approximately as low as the uniqueness of the Balaban J index on exhaustively generated (general) graphs.

Publication types

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

MeSH terms

Models, Theoretical*

Grants and funding

Matthias Dehmer thanks the Austrian Science Funds for supporting this work (project P22029-N13). Yongtang Shi has 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.