Distance preserving graphs and graph products

M. H. Khalifeh, Bruce E. Sagan, Emad Zahedi

If $G$ is a graph then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v)=d_G(u,v)$ where $d$ is the distance function. We say a graph $…