On Distance Preserving and Sequentially Distance Preserving Graphs

Jason P. Smith, Emad Zahedi

A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)=d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of e…