Emad Zahedi

activity

20152018

collaborators

3 papers

cs.DM2018

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…

cs.DM2017

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…

math.CO2015

Distance Preserving Graphs

Emad Zahedi

Given a graph $G$ then a subgraph $H$ is $i so m e t r i c$ if, for every pair of vertices $u, v$ of $H$ , we have $d_{H} (u, v) = d_{G} (u, v)$ . We say a graph $G$ is $d i s t an ce p r eser v in g (d p)$ …