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.
Properties of the k-centra in a Tree Network
ANDREATTA, GIOVANNI;
1985
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
