Centers and medians of distance-hereditary graphs

Hong Gwa Yeh, Gerard J. Chang

研究成果: 雜誌貢獻期刊論文同行評審

15 引文 斯高帕斯(Scopus)

摘要

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.

原文???core.languages.en_GB???
頁(從 - 到)297-310
頁數14
期刊Discrete Mathematics
265
發行號1-3
DOIs
出版狀態已出版 - 6 4月 2003

指紋

深入研究「Centers and medians of distance-hereditary graphs」主題。共同形成了獨特的指紋。

引用此