Centers and medians of distance-hereditary graphs

被引：15

作者：

Yeh, HG

Chang, GJ ^{[1
]}

机构：

[1] Natl Cent Univ, Dept Math, Chungli 320, Taiwan

[2] Natl Taiwan Univ, Dept Math, Taipei 106, Taiwan

来源：

DISCRETE MATHEMATICS | 2003年 / 265卷 / 1-3期

关键词：

distance; eccentricity; diameter; radius; center; median; distance-hereditary graph; chordal graph; Ptolemaic graph;

D O I：

10.1016/S0012-365X(02)00630-1

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：297 / 310

页数：14

共 42 条

[1] DISTANCE-HEREDITARY GRAPHS [J].