Abstract.
In this paper we introduce a new order on the set of n-dimensional tuples and prove that this order preserves nestedness in the edge isoperimetric problem for the graph P n, defined as the nth cartesian power of the well-known Petersen graph. The cutwidth and wirelength of P n are also derived. These results are then generalized for the cartesian product of P n and the m-dimensional binary hypercube.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received August 20, 1999
Rights and permissions
About this article
Cite this article
Bezrukov, S., Das, S. & Elsässer, R. An Edge-Isoperimetric Problem for Powers of the Petersen Graph. Annals of Combinatorics 4, 153–169 (2000). https://doi.org/10.1007/s000260050003
Issue Date:
DOI: https://doi.org/10.1007/s000260050003