Centers and medians of distance-hereditary graphs
Journal
Discrete Mathematics
Journal Volume
265
Journal Issue
1-3
Pages
297-310
Date Issued
2003
Author(s)
Abstract
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. © 2002 Elsevier Science B.V.
SDGs
Type
journal article