About us      Divisions     Telescopes     Science     Publications     Education     Targeted training     Service     Contacts

Preprints. 2004

Algorithms of definition of absolute P-centers on prefractal graphs with complete n-vertex graph as a seeding agent

In the present paper a p_i^l-center of the prefractal (n,L)-graph G_l = (V_l,E_l) with complete n-vertex 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 n-vertex graph.