@article{f2fe91b7ddc84f29ad08575d147faa4a,
title = "Centers and medians of distance-hereditary graphs",
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.",
keywords = "Center, Chordal graph, Diameter, Distance, Distance-hereditary graph, Eccentricity, Median, Ptolemaic graph, Radius",
author = "Yeh, {Hong Gwa} and Chang, {Gerard J.}",
note = "Funding Information: E-mail addresses:
[email protected] (H.-G. Yeh),
[email protected] (G.J. Chang). 1Supported in part by the National Science Council under grant NSC87-2125-M009-007.",
year = "2003",
month = apr,
day = "6",
doi = "10.1016/S0012-365X(02)00630-1",
language = "???core.languages.en_GB???",
volume = "265",
pages = "297--310",
journal = "Discrete Mathematics",
issn = "0012-365X",
number = "1-3",
}