Local medians in chordal graphs

Abstract

The median set of a graph G with weighted vertices consists of those vertices that minimized the total distance sum. If the distance sum of a vertex is locally minimal, i.e., with respect to the neighbours of o, then u is called a local median. In this paper it is shown that every local median of a chordal graph is also a median, with respect to any weight… (More)
DOI: 10.1016/0166-218X(90)90009-2

Topics

7 Figures and Tables

Slides referencing similar topics