Premium
The w ‐median of a connected strongly chordal graph
Author(s) -
Lee HaiYen,
Chang Gerard J.
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180704
Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , chordal graph , discrete mathematics
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) = σ x≅v 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 .