| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429018 | Information Processing Letters | 2012 | 7 Pages |
Abstract
Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength of embedding hypercubes into necklace, windmill and snake graphs.
► Embedding and Exact wirelength problems are NP-complete. ► We compute the exact wirelength of hypercube into certain graphs. ► We found the maximum subgraph for hypercubes. ► We define certain host graphs and it is a superior network for research.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Indra Rajasingh, Bharati Rajan, R. Sundara Rajan,