  We resolve two conjectures of Hri\v{n}\'{a}kov\'{a}, Knor and \v{S}krekovski
(2019) concerning the relationship between the variable Wiener index and
variable Szeged index for a connected, non-complete graph, one of which would
imply the other. The strong conjecture is that for any such graph there is a
critical exponent in $(0,1]$, below which the variable Wiener index is larger
and above which the variable Szeged index is larger. The weak conjecture is
that the variable Szeged index is always larger for any exponent exceeding $1$.
They proved the weak conjecture for bipartite graphs, and the strong conjecture
for trees. In this note we disprove the strong conjecture, although we show
that it is true for almost all graphs, and for bipartite and block graphs. We
also show that the weak conjecture holds for all graphs by proving a
majorization relationship.
