If G is a graph then a subgraph H is isometric if, for every pair of vertices u, v of H, we have dH(u, v) = dG(u, v) where d is the distance function. We say a graph G is distance preserving (dp) ifâ€¦ (More)

A graph H is an isometric subgraph of G if dH(u, v) = dG(u, v), for every pair u, v âˆˆ V (H). A graph is distance preserving if it has an isometric subgraph of every possible order. A graph isâ€¦ (More)

A subgraph H of a given graph G is isometric if the distances between every pair of vertices in H are the same as the distances of those vertices in G. We say a graph G is distance preserving ifâ€¦ (More)

Given a graph G, a subgraph H is isometric if dH(u, v) = dG(u, v) for every pair u, v âˆˆ V (H), where d is the distance function. A graph G is distance preserving (dp) if it has an isometric subgraphâ€¦ (More)