The edge-isorperimetric problem on Sierpinski graphs
  Some families of graphs, such as the n-cubes and Sierpinski gaskets, are self-similar. In this paper we show how such recursive structure can be used systematically to prove isoperimetric theorems. 
L. H. Harper
math.CO