The Edge-Isoperimetric Problem on Sierpinski Graphs: Final Resolution

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.

arXiv comment24 pages

References in corpus (1)

• The Range of a Steiner Operation