  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\H{o}s and Howorka).
