Calculating the edge Wiener and edge Szeged indices of graphs

The edge Szeged and edge Wiener indices of graphs are new topological indices presented very recently. It is not difficult to apply a modification of the well-known cut method to compute the edge Szeged and edge Wiener indices of hexagonal systems. The aim of this paper is to propose a method for computing these indices for general graphs under some additional assumptions.