Distance-hereditary graph

A distance-hereditary graph is a type of graph in which the distances between pairs of vertices are preserved in all connected induced subgraphs.