Modular Decomposition of Graphs and the Distance Preserving Property

Emad Zahedi, Jason P. Smith

Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v)=d_G(u,v)$ for every pair $u,v\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if…