Abstract
When (X, d) is a finite metric space and π = (x1, ..., xk) ∈ Xk, a central element for π is an element x of X for which max{d(x, xi): i = 1, ..., k} is minimum. The function that returns the set of all central elements for any tuple π is called the center function on X. In this article, the center function on finite trees is characterized.
Original language | English (US) |
---|---|
Pages (from-to) | 84-87 |
Number of pages | 4 |
Journal | Networks |
Volume | 38 |
Issue number | 2 |
DOIs | |
State | Published - Sep 2001 |
All Science Journal Classification (ASJC) codes
- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications
Keywords
- Centrality
- Location function
- Tree