Centers and medians of distance-hereditary graphs Original Research Article

A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. In this paper, we study metric properties of distance-hereditary graphs. In particular, we determine the structures of centers and medians of distance-hereditary and related graphs. The relations between eccentricity, radius, and diameter of such graphs are also investigated.