| dc.contributor.author | Deniz, Ali | |
| dc.contributor.author | Çakmak, Gökçe | |
| dc.date.accessioned | 2019-10-20T14:28:00Z | |
| dc.date.available | 2019-10-20T14:28:00Z | |
| dc.date.issued | 2018 | |
| dc.identifier.issn | 0960-0779 | |
| dc.identifier.issn | 1873-2887 | |
| dc.identifier.uri | https://dx.doi.org/10.1016/j.chaos.2018.07.040 | |
| dc.identifier.uri | https://hdl.handle.net/11421/17968 | |
| dc.description | WOS: 000445647600053 | en_US |
| dc.description.abstract | We consider the graph-directed iterated function systems and give upper bounds for the diameters of the smallest disks enclosing their attractors. We also give an algorithm to obtain these smallest enclosing disks with any proximity | en_US |
| dc.description.sponsorship | Anadolu University Research Fund [1505F188] | en_US |
| dc.description.sponsorship | This work is supported by Anadolu University Research Fund (grant number 1505F188). | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Pergamon-Elsevier Science LTD | en_US |
| dc.relation.isversionof | 10.1016/j.chaos.2018.07.040 | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Fractals | en_US |
| dc.subject | Graph-Directed Iterated Function System | en_US |
| dc.subject | Smallest Enclosing Disk | en_US |
| dc.title | On the smallest disks enclosing graph-directed fractals | en_US |
| dc.type | article | en_US |
| dc.relation.journal | Chaos Solitons & Fractals | en_US |
| dc.contributor.department | Anadolu Üniversitesi, Fen Fakültesi, Matematik Bölümü | en_US |
| dc.identifier.volume | 114 | en_US |
| dc.identifier.startpage | 483 | en_US |
| dc.identifier.endpage | 490 | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US] |
