Distance-hereditary graph (source code)

= Distance-hereditary graph
{wiki=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.