Skip to main content
Log in

An Edge-Isoperimetric Problem for Powers of the Petersen Graph

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received August 20, 1999

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000260050003

Navigation