Centers and medians of distance-hereditary graphs
Resource
Discrete Mathematics 265,297-310
Journal
Discrete Mathematics 265
Pages
297-310
Date Issued
2003
Date
2003
Author(s)
Yeh, Hong-Gwa
Chang, Gerard J.
DOI
20060927121113789972
Abstract
A graph is distance-hereditary ifthe 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 ofcenters & medians of
distance-hereditary & related graphs. The relations between eccentricity, radius, & diameter
ofsuch graphs are also investigated.
Subjects
Distance
Eccentricity
Diameter
Radius
Center
Median
Distance-hereditary graph
Chordal
graph
graph
Ptolemaic graph
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
0098.pdf
Size
189.87 KB
Format
Adobe PDF
Checksum
(MD5):96e8ac8157db65aba575ad6b2386318d