Preprints. 2004
N202 (November)
Guaranteed estimations of Pmedians of prefractal graphs with
seeding agents  complete nvertex graph, edge, nvertex star
Authors:
A.A.Uzdenov
In the present study the upper and lowerbound estimates of Pmedians
of prefractal (n,L)graphs
G_{l} = (V_{l},E_{l})
with seeding agents  edge, nvertex star, complete nvertex
graph, if prefractal (n,L)graph is a dyadic tree, are found.
An algorithm of optimum determination of Pmedians of prefractal
graphs is proposed.
Keywords: Pmedian, edge, nvertex star,
complete nvertex graph, dyadic tree
Any questions to
webmaster
Last update: 26/12/2008

