THE W-MEDIAN OF A CONNECTED STRONGLY CHORDAL GRAPH

dc.citation.epage	680	en_US
dc.citation.issue	7	en_US
dc.citation.spage	673	en_US
dc.citation.volume	18	en_US
dc.citation.woscount	2
dc.contributor.author	LEE, HY	en_US
dc.contributor.author	CHANG, GJ	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2014-12-08T15:03:44Z
dc.date.available	2014-12-08T15:03:44Z
dc.date.issued	1994-11-01	en_US
dc.description.abstract	Suppose G = (V,E) is a graph in which every vertex x has a non-negative 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 John Wiley & Sons, Inc.	en_US
dc.identifier.doi	10.1002/jgt.3190180704	en_US
dc.identifier.issn	0364-9024	en_US
dc.identifier.journal	JOURNAL OF GRAPH THEORY	en_US
dc.identifier.uri	http://dx.doi.org/10.1002/jgt.3190180704	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/2274
dc.identifier.wosnumber	WOS:A1994PL99200003
dc.language.iso	en_US	en_US
dc.title	THE W-MEDIAN OF A CONNECTED STRONGLY CHORDAL GRAPH	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1