Let G be a connected graph and let µ(G )= DD(G) − W (G), where DD(G )a ndW (G) stand for the detour and Wiener numbers of G ,r espectively. Nadjafi-Arani et al. [Math. Comput. Model. 55 (2012), 1644– 1648] classified connected graphs whose difference between Szeged and Wiener numbers are n ,f orn =4 , 5. In this paper, we continue their work to prove that for any positive integer n � , 2, 4, 6 there is a graph with µ(G )= n.
['Modjtaba Ghorbani', 'Nasrin Azimi']
Differences between detour and Wiener indices