Distance-critical and distance-redundant graphs

Andrew Steane

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 dis…