Show simple item record

dc.creatorMONTENEGRO,EDUARDO
dc.creatorCABRERA,EDUARDO
dc.date2001-08-01
dc.date.accessioned2019-11-14T12:52:44Z
dc.date.available2019-11-14T12:52:44Z
dc.identifierhttps://scielo.conicyt.cl/scielo.php?script=sci_arttext&pid=S0716-09172001000200004
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/115564
dc.descriptionRecently an operation of graphs called substitution has been incorporated. In an informal way, the substitution consists in the replacement of a vertex for a graph. This new graph is characterized through a function (of substitution) that it could be self definable. The substitution of each vertex of a graph G, through injectives functions of substitution, by the same G graph will be called autosubstitution and denoted by G(G). If X represents the class of all the simple and finite graphs and w is an application of X in X, defined by w (G) = G (G), then it is interest in studying the dynamic properties of w and the construction of some algorithms that they permit the generating of fractal images. In function of the above-mentioned it is proposed to analyze the autosubstitution for graphs simple and finite. Framed in the area of the Graph Dynamics, inside the area of the Graph Theory, the present work will use, preferably, simple and finite graph
dc.formattext/html
dc.languageen
dc.publisherUniversidad Católica del Norte, Departamento de Matemáticas
dc.relation10.4067/S0716-09172001000200004
dc.rightsinfo:eu-repo/semantics/openAccess
dc.sourceProyecciones (Antofagasta) v.20 n.2 2001
dc.subjectGraph
dc.subjectsubtitution of graph
dc.subjectdiscrete dynamical systems
dc.titleATTRACTORS POINTS IN THE AUTOSUBSTITUTION


This item appears in the following Collection(s)

Show simple item record