The Uniqueness of DMAX-Matrix Graph Invariants

In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix D-MAX defined by Randic 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.