On the variable Wiener-Szeged inequality

In this note, we use a technique introduced by Klavzar et al. (1996) to obtain a strengthening of well-known inequality between the Szeged and Wiener indices. To bSe more precise, we will prove that if G is a connected graph and alpha > 1, then Sigma(e=uv epsilon E(G)) (n(e)(u)n(e)(v))(alpha) >= Sigma({u, v}subset of V(G)) d(u, v)(alpha) and equality holds if and only if G is complete. (C) 2021 Elsevier B.V. All rights reserved.