Technical Report 230-1989
- Title
- A Minmax Facility Location Problem
- Authors
- Wictor Piotrowski and Maciej M. Syslo
- Source
-
The report may be requested from our secretary Gabriele Klink, email: klink@math.tu-berlin.de
- Classification
-
not available
- Keywords
-
not available
-
In a previous paper the concept of branch weight centroid has been extended so that it can be defined for an arbitrary finite set X with a distinguished family \cal C of "convex" subsets of X. In particular the centroid of a graph was defined for X to be the vertex set of G and the chordless path convexity. In this paper, we give necessary and sufficient conditions for a graph to be a centroid of another one as well as of itself. Then, we apply these results to some particular classes of graphs: chordal, Halin, series-parallel and outerplanar.