Complete binary trees embeddings in Möbius cubes
作者：
Highlights：
• We propose an approach to embed the complete binary tree into the n-dimensional Möbius cube Mn.
• We prove that the complete binary tree with 2n−1 vertices can be embedded with dilation 1, congestion 1, load 1 into Mn and expansion tending to 1.
• The research result in this paper demonstrates that embeddability of the complete binary tree in the n-dimensional Möbius cube is superior to that in the n-dimensional hypercube.
摘要
•We propose an approach to embed the complete binary tree into the n-dimensional Möbius cube Mn.•We prove that the complete binary tree with 2n−1 vertices can be embedded with dilation 1, congestion 1, load 1 into Mn and expansion tending to 1.•The research result in this paper demonstrates that embeddability of the complete binary tree in the n-dimensional Möbius cube is superior to that in the n-dimensional hypercube.
论文关键词：Möbius cube,Complete binary tree,Dilation,Expansion,Load,Congestion,Interconnection architecture
论文评审过程：Received 11 December 2014, Revised 1 August 2015, Accepted 7 September 2015, Available online 20 October 2015, Version of Record 27 November 2015.
论文官网地址：https://doi.org/10.1016/j.jcss.2015.09.004
