Maxim V. Vidyuk

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
In this paper we consider 13 information and topological indices based on the distance in a molecular graph with respect to their discrimination power. The numerical results of discriminating tests on 3490528 trees up to 21 vertices are given. The indices of the highest sensitivity are listed on the set of 1528775 alkane trees. The discrimination powers of(More)
  • 1