Centers and medians of distance-hereditary graphs (Q1874367): Difference between revisions

As it is well known, the center (or median) of a graph \(G\) is the set of vertices of \(G\) in which the maximum distance from other vertices (or, respectively, the sum of distances from other vertices) attains its minimum. A graph \(G\) is distance-hereditary, if each induced subgraph \(F\) of \(G\) has the property that the distance between any vertices \(u\), \(v\) of \(F\) in \(F\) is the same as in \(G\). In particular, the paper studies those graph properties which concern the center and the median.