The edge-isorperimetric problem on Sierpinski graphs
Combinatorics
2016-10-10 v1
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.
Cite
@article{arxiv.1610.02089,
title = {The edge-isorperimetric problem on Sierpinski graphs},
author = {L. H. Harper},
journal= {arXiv preprint arXiv:1610.02089},
year = {2016}
}
Comments
32 pages, 7 figures