On Some Algorithms for Computing Topological Indices of Chemical Graphs

In this note, we present some improvements on the recently proposed algorithms for computing certain topological indices of chemical graphs. In particular, we design simpler recursive algorithm for computing Hosoya index of trees and unicyclic graphs, present better time complexity algorithm for computing Wiener polarity index of chemical graphs, reference more efficient algorithm for computing the Merrifield-Simmons index of graphs, and compute Balaban index of trees in linear time using depth first search algorithm.