Centers and medians of distance-hereditary graphs

Hong Gwa Yeh, Gerard J. Chang

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

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.

Original languageEnglish
Pages (from-to)297-310
Number of pages14
JournalDiscrete Mathematics
Volume265
Issue number1-3
DOIs
StatePublished - 6 Apr 2003

Keywords

  • Center
  • Chordal graph
  • Diameter
  • Distance
  • Distance-hereditary graph
  • Eccentricity
  • Median
  • Ptolemaic graph
  • Radius

Fingerprint

Dive into the research topics of 'Centers and medians of distance-hereditary graphs'. Together they form a unique fingerprint.

Cite this