Distances in Sierpiński graphs and on the Sierpiński gasket

The well known planar fractal called the Sierpiński gasket can be defined with the help of a related sequence of graphs { G n } n  ≥ 0 , where G n is the n-th Sierpiński graph , embedded in the Euclidean plane. In the present paper we prove geometric criteria that allow us to decide, whether a short...

Full description

Saved in:
Bibliographic Details
Published in:Aequationes mathematicae 2013-06, Vol.85 (3), p.201-219
Main Authors: Cristea, Ligia L., Steinsky, Bertran
Format: Article
Language:English
Subjects:
Analysis
Combinatorics
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The well known planar fractal called the Sierpiński gasket can be defined with the help of a related sequence of graphs { G n } n  ≥ 0 , where G n is the n-th Sierpiński graph , embedded in the Euclidean plane. In the present paper we prove geometric criteria that allow us to decide, whether a shortest path between two distinct vertices x and y in G n , that lie in two neighbouring elementary triangles (of the same level), goes through the common vertex of the triangles or through two distinct vertices (both distinct from the common vertex) of those triangles. We also show criteria for the analogous problem on the planar Sierpiński gasket and in the 3-dimensional Euclidean space.
ISSN:0001-9054
1420-8903
DOI:10.1007/s00010-013-0197-7