Affiliation:
1. Department of Computer Science, University of California, Santa Barbara, California 93106, USA
Abstract
The d–dimensional k-ary array [Formula: see text] is the d–fold Cartesian product graph of the path graph Pk with k vertices. We show that the (edge) isoperimetric number [Formula: see text] of [Formula: see text] is given by [Formula: see text] and identify the cardinalities and the structure of the isoperimetric sets. For odd k, the cardinalities of isoperimetric sets in [Formula: see text] are [Formula: see text], whereas every isoperimetric set for k even has cardinality [Formula: see text].
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献