加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本