Show simple item record

dc.creatorMontenegro, Eduardo
dc.creatorCabrera, Eduardo
dc.date2017-04-24
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1507
dc.identifier10.4067/S0716-09172001000200004
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 fi- nite 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.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1507/1285
dc.rightsCopyright (c) 2001 Proyecciones. Journal of Mathematicsen-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 20 No. 2 (2001); 193-204en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 20 Núm. 2 (2001); 193-204es-ES
dc.source0717-6279
dc.subjectGraphes-ES
dc.subjectSubstitution of graphes-ES
dc.subjectDiscrete dynamical systems.es-ES
dc.titleAttractors points in the autosubstitutiones-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US


This item appears in the following Collection(s)

Show simple item record