Scientific Journal of KubSAU

Polythematic online scientific journal
of Kuban State Agrarian University
ISSN 1990-4665
AGRIS logo UlrichsWeb logo DOAJ logo

Name

Kunizheva Larisa Adamovna

Scholastic degree

—

Academic rank

—

Honorary rank

—

Organization, job position

North-Caucasian State Humanitarian Technological Academy
   

Web site url

—

Email

—


Articles count: 4

192 kb

DIAMETER AND RADIUS OF THE WEIGHTED PREFRACTAL GRAPH BY A COMPLETE BIPARTITE SEED

abstract 1341710033 issue 134 pp. 390 – 403 29.12.2017 ru 551
Researches of metric characteristics on prefractal graphs are known tasks. Such tasks arise when determining estimates of length, of depth, of width of the graph. Also these questions arise when determining results of optimization of these tasks of the prefractal graphs. Properties of metric characteristics depend on a trajectory of generation of the prefractal graph and on the characteristic of primings. In this work, metric characteristics on prefractal weighed graphs are investigated, dependence of metric characteristics on a trajectory of a priming and prefractal graphs is revealed. Estimates are obtained for the diameter and radius of the weighted prefractal and fractal graphss
151 kb

ESTIMATION OF VIRUSES DISTRIBUTION AREA DIAMETER USING MODELS ON PREFRACTAL GRAPHS

abstract 1031409085 issue 103 pp. 1231 – 1240 30.11.2014 ru 1300
The article investigates the problem of estimation of diameters of prefractal graphs with priming stars and with full priming which contiguity of old edges in a trajectory isn't broken on spectra
164 kb

MULTICRITERIA PROBLEM DEFINITION OF A SELECTION OF PROJECTS TARGETED PROGRAMS

abstract 0881304031 issue 88 pp. 471 – 485 30.04.2013 ru 1567
In the article, we have considered the economic-mathematical model of selection of projects targeted programs on the example of the Russian Federation. The article also defines criteria of their distribution. We have proposed the parallel algorithm with the guaranteed estimates of the allocation of graph
161 kb

RECOGNITION OF PRE-FRACTAL COUNT, DESCENDANT COMPLETE DICOTYLEDONOUS PRIMER

abstract 0911307057 issue 91 pp. 799 – 813 30.09.2013 ru 1804
In the article the algorithms of recognition of structures of complex network systems and objects are offered. As a model of structures we have considered a pre-fractal graph. Necessary and sufficient signs of pre-fractal structures are stated. The theorems proving work of offered algorithms are proved
ßíäåêñ.Ìåòðèêà