Centers and medians of distance-hereditary graphs

Hong Gwa Yeh; Gerard J. Chang

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

Centers and medians of distance-hereditary graphs

Hong Gwa Yeh, Gerard J. Chang

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

16 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 language	English
Pages (from-to)	297-310
Number of pages	14
Journal	Discrete Mathematics
Volume	265
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(02)00630-1
State	Published - 6 Apr 2003

Keywords

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

Access to Document

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

Cite this

@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",

}

TY - JOUR

T1 - Centers and medians of distance-hereditary graphs

AU - Yeh, Hong Gwa

AU - Chang, Gerard J.

N1 - 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.

PY - 2003/4/6

Y1 - 2003/4/6

N2 - 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.

AB - 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.

KW - Center

KW - Chordal graph

KW - Diameter

KW - Distance

KW - Distance-hereditary graph

KW - Eccentricity

KW - Median

KW - Ptolemaic graph

KW - Radius

UR - http://www.scopus.com/inward/record.url?scp=84867936259&partnerID=8YFLogxK

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

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

M3 - 期刊論文

AN - SCOPUS:84867936259

SN - 0012-365X

VL - 265

SP - 297

EP - 310

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Centers and medians of distance-hereditary graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this