Abstract
We consider the family of graphs whose vertex set is where two vertices are connected by an edge when their -distance is 1. Towards an edge isoperimetric inequality for this graph, we calculate the edge boundary of any finite set . This boundary calculation leads to a desire to show that a set with optimal edge boundary has no ``gaps'' in any direction . We show that one can find a set with optimal edge boundary that does not have gaps in any direction (or ) where is the standard basis vector.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.