2024/06/05 by Stijn Cambie, Cambie, Stijn
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Complexity and Algorithms in Graphs
paper · pdf · doi:10.48550/arxiv.2406.03451
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.