  We explore the question asking for graphs $G$ for which the total distance
decreases, possibly by a fixed constant $k$, upon the removal of any of its
vertices. We obtain results leading to intuition and doubts for the
\v{S}olt\'es' problem ($k=0$) and its conjectures.
