Preprints. 2004
N201 (November)
Algorithms of definition of absolute Pcenters on
prefractal graphs with complete nvertex graph as a seeding agent
Authors:
A.A.Uzdenov, D.A.Pavlov.
In the present paper a p_{i}^{l}center of the prefractal
(n,L)graph G_{l} = (V_{l},E_{l})
with complete nvertex graph as a seeding agent was found. For the
p_{i}^{l}center to be found two algorithms of the solution
of a problem about absolute p_{i}^{l}centers are offered.
Keywords: p_{i}^{l}center, complete nvertex graph.
Any questions to
webmaster
Last update: 26/12/2008

