Distance-critical and distance-redundant graphs
arXiv:2403.16197
Abstract
If a vertex in a graph can be deleted without affecting distances among the other vertices, we shall say it is distance-redundant. Graphs with all, some or no such vertices are discussed. (The latter class was termed distance-critical by Erdős and Howorka).
16 pages, 16 figures, 4 tables