Properties of the k-centra in a tree network

The k‐centrum of a graph G ‐ (V, E)is the set of vertices each minimizing the sum of the distances from it to the corresponding k farthest vertices of G. In this article properties of k‐centrum of trees, where edges have positive real lengths, are investigated.

Saved in:
Bibliographic Details
Published in:Networks 1985-03, Vol.15 (1), p.21-25
Main Authors: Andreatta, G., Mason, F. M.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The k‐centrum of a graph G ‐ (V, E)is the set of vertices each minimizing the sum of the distances from it to the corresponding k farthest vertices of G. In this article properties of k‐centrum of trees, where edges have positive real lengths, are investigated.
ISSN:0028-3045
1097-0037
DOI:10.1002/net.3230150103