
























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 Šoltés' problem ($k=0$) and its conjectures.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。