We consider the problem of embedding hypercubes into cylinders to minimize the wire-length. Further we show that the edge isoperimetric problem solves the wirelength problem of regular graphs and in particular hypercubes into triangular snakes and caterpillars.
In this paper we formulate the Vertex Congestion Lemma leading to a new technique in computing the exact wirelength of an embedding. We compute the circular wirelength of generalized Petersen graphs by partitioning the vertices as well as the edges of cycles. Further we obtain the linear wirelength of circular ladders. Our algorithms produce optimal values… (More)
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamil-tonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, m˝ obius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes,… (More)