Differences between detour and Wiener indices


Let G be a connected graph and let μ(G) = DD(G) − W (G), where DD(G) and W (G) stand for the detour and Wiener numbers of G, respectively. Nadjafi-Arani et al. [Math. Comput. Model. 55 (2012), 1644– 1648] classified connected graphs whose difference between Szeged and Wiener numbers are n, for n = 4, 5. In this paper, we continue their work to prove that… (More)


11 Figures and Tables

Slides referencing similar topics