The edge-isorperimetric problem on Sierpinski graphs

2016/10/06 by L. H. Harper, Harper, L. H.
Mathematics · #15A18 #Combinatorics (math.CO) #FOS: Mathematics #Primary 05C38 #Secondary 05A15 #math.CO #msc:05A15 #msc:05C38 #msc:15A18

paper · pdf · doi:10.48550/arxiv.1610.02089

32 pages, 7 figures

arxiv created 2016/10/06 · arxiv updated 2016/10/10

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.

Related

• The Edge-Isoperimetric Problem on Sierpinski Graphs: Final Resolution
• A General Method to Determine Limiting Optimal Shapes for Edge-Isoperimetric Inequalities
• Reflect-Push Methods Part I: Two Dimensional Techniques
• A note on Edge Isoperimetric Numbers and Regular Graphs
• Isoperimetry in product graphs