Optimal cuts for powers of the Petersen graph (Q4944983)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1420913
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimal cuts for powers of the Petersen graph
    scientific article; zbMATH DE number 1420913

      Statements

      0 references
      0 references
      0 references
      18 October 2000
      0 references
      Petersen graph
      0 references
      graph power
      0 references
      isoperimetric problem
      0 references
      cut
      0 references
      Optimal cuts for powers of the Petersen graph (English)
      0 references
      The authors introduce a new order on the set of \(n\)-dimensional tuples and prove that this order preserves nestedness in the edge isoperimetric problem for \(P^n\), the \(n\)th Cartesian power of the Petersen graph. They also determine the cutwidth and wirelength of \(P^n\) and generalize these results to Cartesian products of \(P^n\) with the \(m\)-dimensional binary hypercubes. For the entire collection see [Zbl 0929.00074].
      0 references

      Identifiers