Towards the essence of Šoltés' problem

Stijn Cambie

Applied Mathematics and Computation, 2026, vol. 508, issue C

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.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325003479
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:508:y:2026:i:c:s0096300325003479

DOI: 10.1016/j.amc.2025.129621

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().