Towards the essence of Šoltés' problem

IF 3.4 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation Pub Date : 2025-07-07 DOI:10.1016/j.amc.2025.129621

Stijn Cambie

引用次数: 0

Abstract

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.

查看原文本刊更多论文

论Šoltés问题的本质

我们探讨的问题是，图G的总距离减少，可能是一个固定的常数k，当它的任何一个顶点被移除。我们获得了对Šoltés问题（k=0）及其猜想的直觉和怀疑的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Applied Mathematics and Computation 数学-应用数学

CiteScore

7.90

自引率

10.00%

发文量

755

审稿时长

36 days

期刊介绍： Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.