On Constructing Regular Distance-Preserving Graphs

Abdol-Hossein Esfahanian, Ronald Nussbaum, Dennis Ross +1

Let G be a simple, connected graph on n vertices. Let d_G(u,v) denote the distance between vertices u and v in G. A subgraph H of G is isometric if d_H(u,v)=d_G(u,v) for every u,v…