Logo (Main page)
Special Astrophysical Observatory RAS

Russian
   About us      Divisions     Telescopes     Science     Publications     Education     Targeted training     Service     Contacts  

Preprints. 2004

N201 (November)
Algorithms of definition of absolute P-centers on prefractal graphs with complete n-vertex graph as a seeding agent
Authors: A.A.Uzdenov, D.A.Pavlov.

In the present paper a pil-center of the prefractal (n,L)-graph Gl = (Vl,El) with complete n-vertex graph as a seeding agent was found. For the pil-center to be found two algorithms of the solution of a problem about absolute pil-centers are offered.

Keywords: pil-center, complete n-vertex graph.


Any questions to  webmaster 
Last update: 26/12/2008