Discrimination of isomeric structures using information theoretic topological indices

Abstract

Abstract Three newly defined information theoretic topological indices, namely “degree complexity ( I d ),” “graph vertex complexity ( H V ),” and “graph distance complexity ( H D )” along with three other information indices have been used to study their discriminating power of 45 trees and 19 monocyclic graphs. It is found that the newly defined indices have satisfactory discriminating power while H D has been found to be the only index to discriminate all the graphs studied.