3 citations · 5 across the 5 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
The edge-isorperimetric problem on Sierpinski graphs
L. H. Harper
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 isoper…
math.CO2016★ 1 cited
Can the Sierpinski graph be embedded in the Hamming graph?
Lawrence Hueston Harper
The (generalized & expanded) Sierpinski graph, S(n,m), and the Hamming graph have the same set of vertices (n-tuples from the set {0,1,...,m-1}. The edges of both are (unordered) p…
math.CO2016★ 3 cited
The Range of a Steiner Operation
L. H. Harper
This paper answers a fundamental question in the theory of Steiner operations (StOps) as defined and studied in the monograph, "Global Methods for Combinatorial Isoperimetric Probl…