The Edge-Isoperimetric Problem on Sierpinski Graphs: Final Resolution

2018/02/23 by L. H. Harper, Harper, L. H.
Engineering · Mathematics · #Advanced Combinatorial Mathematics #Graph theory and applications #graph theory and CDMA systems #math.CO #msc:05C35 #msc:05C78 #msc:68M07 #msc:90C27

paper · pdf · doi:10.48550/arxiv.1802.08355

24 pages

arxiv created 2018/02/23 · arxiv updated 2018/02/26

Abstract

This paper completes the project started in [10]; to solve the edge-isoperimetric problem on the (generalized and extended) Sierpinski graph, S(n,m). We prove that initial segments of lexicographic order are solutions of the EIP for all n,m.

Related

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