Optimal cuts for powers of the Petersen graph

From MaRDI portal





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].











This page was built for publication: Optimal cuts for powers of the Petersen graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944983)