Journal of Automation and Information Sciences
Publicado 12 números por año
ISSN Imprimir: 1064-2315
ISSN En Línea: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Generalized Algorithm of Recognition of a Prefractal Graph
Volumen 37,
Edición 4, 2005,
pp. 1-10
DOI: 10.1615/J Automat Inf Scien.v37.i4.10
SINOPSIS
Properties of complete noncanonical prefractal graphs are studied. Graphs have arbitrary number of vertices, which are substituted, and old vertices have intersections. A generalized algorithm of recognition if such graphs are prefractal, is suggested. The cases, when the one or more graphs from the prescribed set are selected as nucleator, are considered. Possible fields of use of the algorithms are presented.
253 Vistas de artículos
3 Descargas de artículos
Métrica
Artículos con contenido similar:
Último edicion
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020