The Edge-Isoperimetric Problem on Sierpinski Graphs: Final Resolution
Combinatorics
2018-02-26 v1
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.
Cite
@article{arxiv.1802.08355,
title = {The Edge-Isoperimetric Problem on Sierpinski Graphs: Final Resolution},
author = {L. H. Harper},
journal= {arXiv preprint arXiv:1802.08355},
year = {2018}
}
Comments
24 pages