Though embedding problems have been considered for several regular graphs, it is still an open problem for hypercube into torus. In the paper, we prove the conjecture mathematically and obtain the minimum wirelength of embedding for hypercube into Cartesian product of paths and/or cycles. In addition, we explain that Gray code embedding is an optimal strategy in such embedding problems.

翻译：尽管一些常规图表已经考虑过嵌入问题,但它仍然是超立方体进入托鲁斯的未决问题。 在论文中,我们从数学上证明了推测,并获得了将超立方体嵌入笛卡尔语的路径和/或周期产品的最低线长。 此外,我们解释,灰色代码嵌入是这类嵌入问题的最佳策略。</s>