| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418549 | Discrete Applied Mathematics | 2011 | 8 Pages |
Abstract
We consider the problem of embedding hypercubes into cylinders to minimize the wirelength. Further, we show that the edge isoperimetric problem solves the wirelength problem of regular graphs and, in particular, hypercubes into triangular snakes and caterpillars.
► Lexicographic embedding of hypercubes into cylinders. ► A method to compute the exact wirelength of regular graphs with optimal order into triangular snakes and caterpillars. ► Using this method, the exact wirelength of powers of the Petersen graph and discrete tori can be computed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paul Manuel, M. Arockiaraj, Indra Rajasingh, Bharati Rajan,