The edge-isorperimetric problem on Sierpinski graphs
arXiv:1610.02089
Abstract
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.
arXiv comment32 pages, 7 figures