1984/12/01 by Chandan Raychaudhury, Sudipta Ray, Joydip Ghosh +2 · 1 voice · 1 citation
Mathematics · Computer Science · #Graph theory and applications #Computational Drug Discovery Methods #Graph Labeling and Dimension Problems
paper · doi:10.1002/jcc.540050612
openalex publication_date 1984/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
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.