THE W-MEDIAN OF A CONNECTED STRONGLY CHORDAL GRAPH

Authors
LEE HY CHANG GJ
Citation
Hy. Lee et Gj. Chang, THE W-MEDIAN OF A CONNECTED STRONGLY CHORDAL GRAPH, Journal of graph theory, 18(7), 1994, pp. 673-680
Citations number
10
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
18
Issue
7
Year of publication
1994
Pages
673 - 680
Database
ISI
SICI code
0364-9024(1994)18:7<673:TWOACS>2.0.ZU;2-#
Abstract
Suppose G = (V,E) is a graph in which every vertex x has a non-negativ e real number w(x) as its weight. The w-distance sum of a vertex y is D(G,W)(y) = SIGMA(xis-an-element-ofV) d(y,x)w(x). The w-median of G is the set of all vertices y with minimum w-distance sum D(G,W)(y). This paper shows that the w-median of a connected strongly chordal graph G is a clique when w(x) is positive for all vertices x in G. (C) 1994 J ohn Wiley & Sons, Inc.